SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems

Czajkowski, Karl; Foster, Ian; Kesselman, Carl; Sander, Volker; Tuecke, Steven

doi:10.1007/3-540-36180-4_9

Cited by 278 publications

(184 citation statements)

References 21 publications

Supporting

Mentioning

182

Contrasting

Unclassified

Order By: Relevance

“…Several research efforts have proposed bounded resource units such as leases, slices, advanced reservations, etc [6,9,12,13]. These abstractions define properties for time and resource information but have little or no QoS information.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Deadline-sensitive workflow orchestration without explicit resource control

Ramakrishnan

Chase

Gannon

et al. 2011

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Deadline-sensitive workflows require careful coordination of user constraints with resource availability. Current distributed resource access models provide varying degrees of resource control: from limited or none in grid batch systems to explicit in cloud systems. Additionally applications experience variability due to competing user loads, performance variations, failures, etc. These variations impact the quality of service(QoS) that goes unaccounted for in planning strategies. In this paper we propose Workflow ORchestrator for Distributed Systems (WORDS ) architecture based on a least common denominator resource model that abstracts the differences and captures the QoS properties provided by grid and cloud systems. We investigate algorithms for effective orchestration (i.e., resource procurement and task mapping) for deadline sensitive workflows atop the resource abstraction provided in WORDS . Our evaluation compares orchestration methodologies over TeraGrid and Amazon EC2 systems. Experimental results show that WORDS enables effective orchestration possible at reasonable costs on batch queue grid and cloud systems with or without explicit resource control.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Resource mechanisms and protocols are available today to coordinate grid resources and ensure quality of service (QoS) [5,6,27]. There are tools for workflow planning using performance models [3,10,18] and execution systems or workflow engines for managing runtime environment of workflows [4,15].…”

Section: Introductionmentioning

confidence: 99%

Deadline-sensitive workflow orchestration without explicit resource control

Ramakrishnan

Chase

Gannon

et al. 2011

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Research on SLAs has focused on negotiation protocols [28], translation into device configurations [29], and monitoring of compliance [30]. SLAs have also been integrated into service management architectures, for instance [31,2].…”

Section: Related Workmentioning

confidence: 99%

Network-aware service placement and selection algorithms on large-scale overlay networks

Famaey¹,

Wauters²,

Turck³

et al. 2011

Computer Communications

View full text Add to dashboard Cite

Currently many service providers offer their services on a private and proprietary hard-and software infrastructure. These infrastructures often share many similarities. Hence we believe a generic service management architecture, that allows service providers to offer a large array of different services on a single infrastructure or multiple providers to offer their services cooperatively, would provide many advantages over current silo-based approaches. Additionally, by allowing the distributed service management components to cooperate in a peerto-peer overlay network, scalability and resilience of the system could be greatly improved.In this paper we propose an optimal algorithm, based on an Integer Linear Programming (ILP) formulation, and several heuristics to support such a generic overlay-based service management architecture. More specifically, we propose algorithms for dynamically allocating server and network resources to a set of services and selecting a suitable service instance for each client. Service instances are placed on a set of servers, taking into account server resource constraints (e.g. CPU and memory). Unlike existing algorithms for this problem, those proposed in this paper also support Service Level Agreements (SLAs), which take the form of Quality of Service demands such as transmission latency constraints and bandwidth requirements. The optimization goal is to maximise the percentage of satisfied demand (answered requests) and minimise the total number of required * Corresponding author; Tel: +32 9 331 49 38; Fax: +32 9 331 48 99Email addresses: jeroen.famaey@intec.ugent.be (J. Famaey), tim.wauters@intec.ugent.be (T. Wauters), filip.deturck@intec.ugent.be (F. De Turck), bart.dhoedt@intec.ugent.be (B. Dhoedt), piet.demeester@intec.ugent.be (P. Demeester) Preprint submitted to ElsevierMarch 1, 2010 overlay servers, while satisfying the SLAs and resource constraints. Additionally, we propose an extension that allows the algorithms to find overlay routing paths to improve the transmission latency for latency-sensitive services.Extensive simulations were performed to evaluate the performance and scalability of the heuristics. They showed that in many cases the heuristics perform close to optimal and they scale well in terms of network size.

show abstract

“…Its application to services was propagated with the emergence of Grid Computing. At first the Globus Resource Allocation Manager (GRAM) [4] lacked a general negotiation protocol that was added later (as described in [5]) in form of the Service Negotiation and Acquisition Protocol (SNAP) [6] that addresses complex, multi-level SLA management. SNAP defines three types of SLAs: Task SLAs, Resource SLAs and Binding SLAs and provides a generic framework, however as Quan et al [7] underline the protocol needs further extensions for its implementation to address specific problems.…”

Section: Related Workmentioning

confidence: 99%

Dynamic SLA Negotiation in Autonomic Federated Environments

Rubach

Sobolewski

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Federated computing environments offer requestors the ability to dynamically invoke services offered by collaborating providers in the virtual service network. Without an efficient resource management that includes Dynamic SLA Negotiation, however, the assignment of providers to customer's requests cannot be optimized and cannot offer high reliability without relevant SLA guarantees. We propose a new SLA-based SERViceable Metacomputing Environment (SERVME) capable of matching providers based on QoS requirements and performing autonomic provisioning and deprovisioning of services according to dynamic requestor needs. This paper presents the SLA negotiation process that includes ondemand provisioning and uses an object-oriented SLA model for large-scale serviceoriented systems supported by SERVME. An initial reference implementation in the SORCER environment is also described.

show abstract

SNAP: A Protocol for Negotiating Service Level Agreements and Coordinating Resource Management in Distributed Systems

Cited by 278 publications

References 21 publications

Deadline-sensitive workflow orchestration without explicit resource control

Deadline-sensitive workflow orchestration without explicit resource control

Network-aware service placement and selection algorithms on large-scale overlay networks

Dynamic SLA Negotiation in Autonomic Federated Environments

Contact Info

Product

Resources

About