DocumentCode :
3074751
Title :
Analysis of Response Time Percentile Service Level Agreements in SOA-Based Applications
Author :
Boloor, Keerthana ; Chirkova, Rada ; Salo, Tiia ; Viniotis, Yannis
Author_Institution :
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
fYear :
2011
fDate :
5-9 Dec. 2011
Firstpage :
1
Lastpage :
6
Abstract :
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.
Keywords :
cloud computing; computational complexity; distributed processing; heuristic programming; service-oriented architecture; simulated annealing; NP-hard problem; SOA-based applications; Web-based application; cloud platform services; cloud providers; distributed software; heuristic algorithm; large scale datacenters; linear penalty charging function; penalty function effect analysis; price differentiation; response time percentile service level agreement analysis; service oriented architecture; simulated annealing; Heuristic algorithms; IEEE Communications Society; Resource management; Schedules; Servers; Simulated annealing; Time factors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
Conference_Location :
Houston, TX, USA
ISSN :
1930-529X
Print_ISBN :
978-1-4244-9266-4
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2011.6133866
Filename :
6133866
Link To Document :
بازگشت