SLA based profit optimization in autonomic computing systems

ABSTRACT

With the development of the Service Oriented Architecture (SOA), organizations are able to compose complex applications from distributed services supported by third party providers. Under this scenario, large data centers provide services to many customers by sharing available IT resources. This leads to the efficient use of resources and the reduction of operating costs. Service providers and their customers often negotiate utility based Service Level Agreements (SLAs) to determine costs and penalties based on the achieved performance levels. Data centers often employ an autonomic computing infrastructure and use a centralized dispatch and control component (a dispatcher) to distribute the user requests to backend servers, and to set the scheduling policies at each server. This dispatcher can also decide to turn ON or OFF servers depending on the system load. This paper designs a set of dispatching and control policies for the dispatcher in such service oriented environments. The objective is to maximize the provider's profits associated with multiple class of SLAs. We show that the overall problem is NP-hard, and develop meta-heuristic solutions based on the tabu-search algorithm. Experimental results are presented to show the benefits of our approach.

REFERENCES

• 1: Tarek F. Abdelzaher , Kang G. Shin , Nina Bhatti, Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach, IEEE Transactions on Parallel and Distributed Systems, v.13 n.1, p.80-96, January 2002 [doi>10.1109/71.980028]
• 2: M. Mostofa Akbar , Eric G. Manning , Gholamali C. Shoja , Shahadat Khan, Heuristic Solutions for the Multiple-Choice Multi-dimension Knapsack Problem, Proceedings of the International Conference on Computational Science-Part II, p.659-668, May 28-30, 2001
• 3: Appleby, K., Fakhoury, S., Fong, L., Goldszmidth, G., Kalantar, M., Krishnakumar, S., Pazel, D. P., Pershing, J., Rochwerger, B. 2001. Oceano- SLA Based Management of a Computing Utility. In Proc. of the IFIP/IEEE Symposium on Integrated Network Management, 855--868.
• 4: Boutilier, C., Das, R., Kephart, G. Tesauro, G. Walsh W. 2003. Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation. To appear, Uncertainty in Artificial Intelligence.
• 5: Chandra, A., Goyal, P., Shenoy, P. 2003. Quantifying the Benefits of Resource Multiplexing in On-Demand Data Centers. In Proc. of the 1st Workshop on Algorithms and Architectures for Self-Managing Systems, San Diego, CA.
• 6: Abhishek Chandra , Weibo Gong , Prashant Shenoy, Dynamic resource allocation for shared data centers using online measurements, Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 11-14, 2003, San Diego, CA, USA
• 7: Jeffrey S. Chase , Darrell C. Anderson , Prachi N. Thakar , Amin M. Vahdat , Ronald P. Doyle, Managing energy and server resources in hosting centers, Proceedings of the eighteenth ACM symposium on Operating systems principles, October 21-24, 2001, Banff, Alberta, Canada
• 8: Xiangping Chen , Prasant Mohapatra , Huamin Chen, An admission control scheme for predictable server response time for web accesses, Proceedings of the 10th international conference on World Wide Web, p.545-554, May 01-05, 2001, Hong Kong, Hong Kong [doi>10.1145/371920.372156]
• 9: Fred Glover , Fred Laguna, Tabu Search, Kluwer Academic Publishers, Norwell, MA, 1997
• 10: Kim, D., Pardalos, P.M. 1999. Dynamic Slope Scaling and Trust Interval Techinques for Solving Concave Piecewise Linear Network Flow Problems. Networks 35, 3, 216--222.
• 11: Zhen Liu , Mark S. Squillante , Joel L. Wolf, On maximizing service-level-agreement profits, Proceedings of the 3rd ACM conference on Electronic Commerce, p.213-223, October 14-17, 2001, Tampa, Florida, USA [doi>10.1145/501158.501185]
• 12: Liu, Z., Squillante, M. S., Wolf, J. 2002. Optimal Resource Management in e-Business Environments with Strict Quality-of-Service Performance Guarantees. IEEE Conference on Decision and Control.
• 13: Shen, K., Tang, H., Yang, T. 2002. A Flexible QoS Framework for Cluster-based Network Services. citeseer.nj.nec.com/485133.html.
• 14: Bhuvan Urgaonkar , Prashant Shenoy , Timothy Roscoe, Resource overbooking and application profiling in shared hosting platforms, ACM SIGOPS Operating Systems Review, v.36 n.SI, Winter 2002 [doi>10.1145/844128.844151]
• 15: Akshat Verma , Sugata Ghosal, On admission control for profit maximization of networked service providers, Proceedings of the 12th international conference on World Wide Web, May 20-24, 2003, Budapest, Hungary [doi>10.1145/775152.775171]
• 16: Joel L. Wolf , Philip S. Yu, On balancing the load in a clustered web farm, ACM Transactions on Internet Technology (TOIT), v.1 n.2, p.231-261, November 2001 [doi>10.1145/502152.502155]
• 17: Zhang, Z. L., Towsley, D., Kurose, J. 1995. Statistical analysis of the generalized processor sharing scheduling discipline. IEEE Journal on Selected Areas in Communications, 13,6, 1071--1080.

INDEX TERMS

Primary Classification:
  B. Hardware
  B.8 Performance and Reliability

General Terms:
Algorithms, Management, Performance

Keywords:
e-business, management, models, monitoring, quality, quality of service, reliability and availability, service, service delivery