Analysis of Response Time Percentile Service Level Agreements in SOA-Based Applications

A large number of enterprise, web-based, distributed software applications are designed on Service Oriented Architecture (SOA) principles and hosted in large scale datacenters managed by cloud providers. Typically, Service Level Agreements (SLAs) are negotiated between the consumers of the cloud platform services and the cloud provider. In this work, we consider SLAs that involve percentiles of response times as part of the performance metrics; the SLAs stipulate that a penalty be charged to the cloud provider if the SLA targets are not met. The main motivation for considering such SLAs is their potential for price differentiation. We focus our analysis on the effects the penalty function has on the achieved response time percentiles. In particular, we analyze the effect of three commonly deployed choices (linear, exponential or step-wise functions) to relate the penalty charged and the achieved percentile. This analysis is NP-hard, so we employ a heuristic algorithm that is based on simulated annealing. Our results indicate that the linear penalty charging function is ``best'' in the sense that it maximizes the achieved response time percentiles.

[1]  Randy H. Katz,et al.  Above the Clouds: A Berkeley View of Cloud Computing , 2009 .

[2]  Anastasios Gounaris,et al.  Honoring SLAs on cloud computing services: A control perspective , 2009, 2009 European Control Conference (ECC).

[3]  Erich M. Nahum,et al.  Achieving Class-Based QoS for Transactional Workloads , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[4]  Nitin Agarwal,et al.  Performance space of a GI/G/1 queueing system under a percentile goal criterion , 1995, MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[5]  Vincenzo Grassi,et al.  Adaptive Management of Composite Services under Percentile-Based Service Level Agreements , 2010, ICSOC.

[6]  Rajarshi Das,et al.  A Hybrid Reinforcement Learning Approach to Autonomic Resource Allocation , 2006, 2006 IEEE International Conference on Autonomic Computing.

[7]  Harry G. Perros,et al.  SLA-Based Service Composition in Enterprise Computing , 2008, 2008 16th Interntional Workshop on Quality of Service.

[8]  Rada Chirkova,et al.  Heuristic-Based Request Scheduling Subject to a Percentile Response Time SLA in a Distributed Cloud , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[9]  Albert Y. Zomaya,et al.  Profit-Driven Service Request Scheduling in Clouds , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[10]  Alfons Kemper,et al.  Adaptive quality of service management for enterprise services , 2008, TWEB.

[11]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[12]  Kenneth R. Baker,et al.  Principles of Sequencing and Scheduling , 2018 .

[13]  Wojciech Cellary,et al.  e-government based on cloud computing and service-oriented architecture , 2009, ICEGOV '09.

[14]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.

[15]  Danilo Ardagna,et al.  SLA based resource allocation policies in autonomic environments , 2007, J. Parallel Distributed Comput..