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
Journal ArticleDOI
TL;DR: This paper analytically characterize, prototype in software and test through field trials the optimal bandwidth manager for intra-datacenter live migration of VMs, which is the minimization of the migration-induced communication energy under service level agreement (SLA)-induced hard constraints on the total migration time, downtime, slowdown of the migrating applications and overall available bandwidth.

22 citations

Proceedings ArticleDOI
10 Mar 2014
TL;DR: This work proposes an energy efficient job scheduling approach based on a modified version of Weighted Round Robin scheduler that incorporates VMs reuse and live VM migration without compromising the Service Level Agreement (SLA).
Abstract: In recent years, the rapid evolving Cloud Computing technologies multiply challenges including minimizing power consumption and meeting Quality-of- Services (QoS) requirements in the presence of heavy workloads from a large number of users using shared computing resources. Powering a middle-sized data center normally consumed 80,000kW power every year and computer servers consume around 5% of the global power [1]. In order to address the skyrocket energy cost from the high level resource management aspect, we propose an energy efficient job scheduling approach based on a modified version of Weighted Round Robin scheduler that incorporates VMs reuse and live VM migration without compromising the Service Level Agreement (SLA). Enhanced Weighted Round Robin (EWRR) algorithm enhanced scheduler can monitor the running VMs status for possible VM consolidation or Migration. In addition, VM Manager observes the VMs utilization rate to start live migration from the over-utilizing Processing Element (PE) to under-utilized PEs or to the hibernated PEs by sending WOL (Wake-On-LAN) signal to activate them. Moreover, we have integrated our Dynamic Voltage and Frequency Scaling (DVFS) algorithm in CPU utilization model to specify the required frequency for each task depending on the task complexity and the deadline.

22 citations

Journal ArticleDOI
TL;DR: This paper proposes a novel multiple-access control scheme to provide bandwidth-guaranteed service for high- demand customers, while providing best effort service to low-demand customers according to the service level agreement (SLA).
Abstract: While backbone networks have experienced substantial changes in the last decade, access networks have not changed much. Recently, passive optical networks (PONs) seem to be ready for commercial deployment as access networks, due to the maturity of a number of enabling technologies. Among the PON technologies, Ethernet PON (EPON) standardized by the IEEE 802.3ah Ethernet in the First Mile (EFM) Task Force is the most attractive one because of its high speed, low cost, familiarity, interoperability, and low overhead. In this paper, we consider the issue of upstream channel sharing in the EPONs. We propose a novel multiple-access control scheme to provide bandwidth-guaranteed service for high-demand customers, while providing best effort service to low-demand customers according to the service level agreement (SLA). The analytical and simulation results prove that the proposed scheme performs best in what it is designed to do compared to another well-known scheme that has not considered providing differentiated services. With business customers preferring premium services with guaranteed bandwidth and residential users preferring low-cost best effort services, our scheme could benefit both groups of subscribers, as well as the operators.

22 citations

Patent
15 Aug 2001
TL;DR: In this article, an optical service agent can perform both real-time and off-line analysis for the user, and can interact with various network elements (including the core optical communication network) to handle billing, penalty, and other issues associated with a SLA breach.
Abstract: A system, device, and method for managing service level agreements in an optical communication system uses an optical service agent to manage a service level agreement (SLA) for a user. The optical service agent can perform both real-time and off-line analysis for the user, and can interact with various network elements (including the core optical communication network) to handle billing, penalty, and other issues associated with a SLA breach. Among other things, the optical service agent may monitor and analyze a connection in real-time for determining SLA compliance, gather and maintain statistical information relating to a connection, analyze the statistical information off-line for determining SLA compliance, patterns, and trends, interact with a service provider to enforce penalty provisions in the SLA, interact with a service provider to negotiate a credit for services not provided by the service provider in accordance with the SLA, interact with a service provider to negotiate “replacement” services for a breach of the SLA, interact with various network elements to rectify a breach of the SLA, interact with the service provider to dynamically modify the SLA based upon changing user requirements, and interface with a billing/accounting system to provide SLA-related information.

22 citations

Journal ArticleDOI
TL;DR: A new virtual machine (VM) consolidation technique called Nature-inspired Meta-heuristic Threshold based firefly optimized lottery scheduling (NMT-FOLS) Technique is proposed, which gets better task scheduling performance to balance normal, timely and bursty workloads in CS with lesser time.
Abstract: Scheduling is a considerable problem in cloud to increase the quality of service provisioning with higher resource efficiency. The conventional task scheduling algorithms designed for balancing load in a cloud environment. But, minimizing the Service level agreement (SLA) violation, resource wastage and the energy consumption during the task scheduling process was not solved effectively. In order to resolve these limitations, a new virtual machine (VM) consolidation technique called Nature-inspired Meta-heuristic Threshold based firefly optimized lottery scheduling (NMT-FOLS) Technique is proposed. Initially, user requests are transmitted to the cloud server (CS). Next, NMT-FOLS Technique utilizes Adaptive Regressive Holt–Winters Workload Predictor to discover the workload state as normal or timely or bursty. Using the workload predictor result, NMT-FOLS Technique exploits task scheduler to allocate user requested tasks to optimal VMs. NMT-FOLS Technique applies multi-objective firefly optimization based task scheduling algorithm in normal workload state and multi-objective firefly optimized lottery scheduling algorithm in timely and bursty workload situations. At last, the selected scheduling algorithm in NMT-FOLS Technique assigns the user requested task to best VMs in CS to perform the demanded services. Hence, NMT-FOLS Technique gets better task scheduling performance to balance normal, timely and bursty workloads in CS with lesser time. NMT-FOLS Technique decreases the SLA violation in cloud through scheduling of user tasks to optimal VM. NMT-FOLS performs an experimental process using metrics such as SLA violation, task scheduling efficiency (TSE), makespan, energy utilization and memory usage with number of user-requested tasks over the considered Amazon dataset. From the experimental result, the NMT-FOLS technique improves scheduling efficiency up to 94.6% and reduces the SLA violations and energy utilization from different test cases on an average to 78%, and 63% compared to state-of-the-art works.

22 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