Capacity-driven utility model for service level agreement negotiation of cloud services

Ranaldo, N.; Zimeo, Eugenio

doi:10.1016/j.future.2015.03.007

Cited by 21 publications

(10 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, Yuan et al (2016) built workload scheduling integrated with admission control for distributed cloud data centres, whilst Bi et al (2017) test application-aware dynamic resource provisioning in cloud data centres. Whilst Ranaldo and Zimeo (2016) applied more proactive measures and propose capacity-driven utility model for SLA bilateral negotiation to optimise the utility for cloud service providers, costs and penalties prices, Messina et al (2014Messina et al ( , 2016 discuss an agent based negotiation protocol for cloud SLA.…”

Section: Related Workmentioning

confidence: 99%

Neural adaptive admission control framework: SLA-driven action termination for real-time application service management

Sikora

Magoulas

2019

Enterprise Information Systems

View full text Add to dashboard Cite

Although most modern cloud-based enterprise systems, or operating systems, do not commonly allow configurable/automatic termination of processes, tasks or actions, it is common practice for systems administrators to manually terminate, or stop, tasks or actions at any level of the system. The paper investigates the potential of automatic adaptive control with action termination as a method for adapting the system to more appropriate conditions in environments with established goals for both system's performance and economics. A machine-learning driven control mechanism, employing neural networks, is derived and applied within data-intensive systems. Control policies that have been designed following this approach are evaluated under different load patterns and service level requirements. The experimental results demonstrate performance characteristics and benefits as well as implications of termination control when applied to different action types with distinct run-time characteristics. An automatic termination approach may be eminently suitable for systems with harsh execution time Service Level Agreements, or systems running under conditions of hard pressure on power supply or other constraints. The proposed control mechanisms can be combined with other available toolkits to support deployment of autonomous controllers in high-dimensional enterprise information systems.

show abstract

Section: Related Workmentioning

confidence: 99%

Neural adaptive admission control framework: SLA-driven action termination for real-time application service management

Sikora

Magoulas

2019

Enterprise Information Systems

View full text Add to dashboard Cite

show abstract

“…Such a limit helps to avoid mistakes like an unbounded, automated penalty that was discarded in 2005 by the UK Royal Mail company after causing a loss of £280 million in one year and a half. 1 However, despite the importance of checking the validity of compensations, it has not been dealt with by current research proposals that use some form of compensation in their SLAs [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19]. Instead, they mostly focus on the optimisations of service costs by finding a trade-off between compensation and operation costs or on the automation of several parts of compensation management.…”

Section: Introductionmentioning

confidence: 99%

Automated Validation of Compensable SLAs

Müller

Gutierrez

Fernández

et al. 2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Service Level Agreement (SLA) regulates the provisioning of a service by defining a set of guarantees. Each guarantee sets a Service Level Objective (SLO) on some service metrics, and optionally a compensation that is applied when the SLO is unfulfilled or overfulfilled. Currently, there are software tools and research proposals that use the information about compensations to automate and optimise certain parts of the service management. However, they assume that compensations are well defined, which is too optimistic in some circumstances and can lead to undesirable situations. In this article we discuss about the notion of validity of guarantees with a compensation, which we refer to as compensable guarantees (CG). We describe an abstract model of CGs and we provide a technique that leverages constraint satisfaction problem solvers to automatically validate them. We also present a materialisation of the model of CGs in iAgree, a language to specify SLAs and a tooling support that implements our whole approach. An assessment over 319 CGs taken from 24 real-world SLAs suggests that the expressiveness and effectiveness of our proposal can pave the way for using CGs in a safer and more reliable way.

show abstract

“…Hence, the approach is decentralized in nature and thus, can avoid the single point of failure which exists in centralized approaches [6], [14]- [16]. Negotiation has been broadly used in service selection and composition for building distributed SBSs [17]- [21]. Most of these works focus on the study of service level agreement, i.e., studying the features and performance of different negotiation strategies while overlooking QoS correlations.…”

Section: Introductionmentioning

confidence: 99%