scispace - formally typeset
Search or ask a question
Topic

Service-level agreement

About: Service-level agreement is a research topic. Over the lifetime, 4358 publications have been published within this topic receiving 75333 citations. The topic is also known as: SLA.


Papers
More filters
Book ChapterDOI
05 Sep 2004
TL;DR: Quality of Service (QoS) guarantees must be supported in a network that intends to carry real-time and multimedia traffic effectively and several QoS-based frameworks have been proposed.
Abstract: Quality of Service (QoS) guarantees must be supported in a network that intends to carry real-time and multimedia traffic effectively. The effort of satisfying the QoS different requirements of these applications has resulted in the proposals of several QoS-based frameworks, such as Integrated Services (IntServ) [1], Differentiated Services (DiffServ) [2], and Multi-Protocol Label Switching (MPLS) [6].

17 citations

Patent
David Reed1
31 Oct 2006
TL;DR: In this article, a trend analysis of a job type repeatedly processed by the GRID network is performed to anticipate a future load on the network associated with the job type, and the future load that is anticipated is compared with the at least one performance metric to predict future satisfaction of the SLA.
Abstract: A method for managing a GRID network. The method includes performing trend analysis of a job type repeatedly processed by the GRID network to anticipate a future load on the GRID network associated with the job type. The job type is associated with a service level agreement (SLA). At least one internal performance metric of the GRID network is measured to monitor current GRID network status. The future load that is anticipated is compared with the at least one performance metric to predict future satisfaction of the SLA.

17 citations

Patent
Seth Hasit1
15 Mar 2012
TL;DR: In this paper, the authors present a method for moving data and applications from a cloud or non-cloud network to a cloud network employing a Parameterized Dynamic Model (PDM) having one or more multi-dimensional parameters.
Abstract: Technologies are generally presented for a migration system and a method for moving data and applications from a cloud or non-cloud network to a cloud network employing a Parameterized Dynamic Model (PDM) having one or more multi-dimensional parameters. In some examples, the PDM parameters may represent the Service level Agreement (SLA) requirements that a target cloud may need to satisfy for a successful cloud migration. The PDM may include a Model Execution Code (MEC) module configured to execute the PDM acting upon the PDM parameter in a cloud environment following the sequencing defined in the PDM as a sequencing parameter. The PDM-MEC based migration system may also include fault-tolerance and error recovery during the migration while the MEC code is executed.

17 citations

Proceedings ArticleDOI
17 Apr 2007
TL;DR: An outlier detection algorithm is introduced which zooms in to the fine-grained query contexts which are most affected by an environment change and/or where a perceived overload problem is likely to originate from and shows that isolating these query contexts through either memory quota enforcements or fine- grained load balancing across different database replicas of their respective applications allows to alleviate resource interference in many cases of overload.
Abstract: Recent industry trends towards reducing the costs of ownership in large data centers emphasize the need for database system techniques for both automatic performance tuning and efficient resource usage. The goal is to host several database applications on a shared server farm, including scheduling multiple applications on the same physical server or even within a single database engine, while meeting each application's service level agreement. Automatic provisioning of database servers to applications and virtualization techniques, such as, live virtual machine migration have been proposed as useful tools to address this problem. In this paper we argue that by allocating entire server-boxes and migrating entire application stacks in cases of server overload, these solutions are too coarse-grained for many overload situations. Hence, they may result in resource usage inefficiency, performance penalties, or both. We introduce an outlier detection algorithm which zooms in to the fine-grained query contexts which are most affected by an environment change and/or where a perceived overload problem is likely to originate from. We show that isolating these query contexts through either memory quota enforcements or fine-grained load balancing across different database replicas of their respective applications allows us to alleviate resource interference in many cases of overload.

17 citations

Proceedings ArticleDOI
20 May 2018
TL;DR: The results obtained clearly demonstrate that the proposed EnLoc scheme outperforms the existing schemes in terms of energy efficiency, SLA assurance, and data locality.
Abstract: With the rapid proliferation of big data, real-time processing of huge datasets becomes a challenging task; primarily because of their heterogeneous nature. Due to this, one of the most serious concerns of the modern cloud data centers is massive energy consumption during job execution. Hence, energy-aware task scheduling with data placement are considered as two important parameters for enhanced energy efficiency of modern cloud data centers. Moreover, considering the ``pay-per-use" model of cloud computing infrastructure, it is important to maintain desirable service level agreement (SLA) while attaining improved data locality. Poor task scheduling decisions with limited focus of data locality are the prime reasons for escalated data communications and energy utilization levels. In order to deal with the aforementioned issues, data locality- aware energy-efficient (EnLoc) scheme for task scheduling and data placement has been proposed, particularly for MapReduce framework. The proposed EnLoc scheme is a multi-objective optimization problem (MOOP) and is solved using multi-objective evolutionary algorithm with ``Tchebycheff decomposition"; wherein the formulated MOOP is decomposed into theoretically finite number of subproblems to get optimal scheduling and placement decisions. The proposed scheme has been evaluated on real-time data traces acquired from OpenCloud Hadoop Cluster. The results obtained clearly demonstrate that the proposed EnLoc scheme outperforms the existing schemes in terms of energy efficiency, SLA assurance, and data locality.

17 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
92% related
Network packet
159.7K papers, 2.2M citations
88% related
Wireless network
122.5K papers, 2.1M citations
88% related
Wireless sensor network
142K papers, 2.4M citations
88% related
Scheduling (computing)
78.6K papers, 1.3M citations
87% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202339
2022106
2021183
2020233
2019237
2018255