skip to main content
research-article

Bargaining Game-Based Scheduling for Performance Guarantees in Cloud Computing

Published:13 February 2018Publication History
Skip Abstract Section

Abstract

In this article, we focus on request scheduling with performance guarantees of all users in cloud computing. Each cloud user submits requests with average response time requirement, and the cloud provider tries to find a scheduling scheme, i.e., allocating user requests to limited servers, such that the average response times of all cloud users can be guaranteed. We formulate the considered scenario into a cooperative game among multiple users and try to find a Nash bargaining solution (NBS), which can simultaneously satisfy all users’ performance demands. We first prove the existence of NBS and then analyze its computation. Specifically, for the situation when all allocating substreams are strictly positive, we propose a computational algorithm (CA), which can find the NBS very efficiently. For the more general case, we propose an iterative algorithm (IA), which is based on duality theory. The convergence of our proposed IA algorithm is also analyzed. Finally, we conduct some numerical calculations. The experimental results show that our IA algorithm can find an appropriate scheduling strategy and converges to a stable state very quickly.

References

  1. Shailendra S. Aote and M. U. Kharat. 2009. A game-theoretic model for dynamic load balancing in distributed systems. In Proceedings of the International Conference on Advances in Computing, Communication and Control. ACM, 235--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Jean-Pierre Aubin. 2007. Mathematical Methods of Game and Economic Theory. Courier Dover Publications.Google ScholarGoogle Scholar
  3. Avrim Blum, Jamie Morgenstern, Ankit Sharma, and Adam Smith. 2015. Privacy-preserving public information for sequential games. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science. ACM, 173--180. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Junwei Cao, Kai Hwang, Keqin Li, and Albert Y. Zomaya. 2013. Optimal multiserver configuration for profit maximization in cloud computing. IEEE Transactions on Parallel and Distributed Systems 24, 6 (2013), 1087--1096. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Junwei Cao, Keqin Li, and Ivan Stojmenovic. 2014. Optimal power allocation and load distribution for multiple heterogeneous multicore server processors across clouds and data centers. IEEE Transactions on Computers 63, 1 (2014), 45--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sivadon Chaisiri, Bu-Sung Lee, and Dusit Niyato. 2012. Optimization of resource provisioning cost in cloud computing. IEEE Transactions on Services Computing 5, 2 (2012), 164--177. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Bin Dong, Xiuqiao Li, Qimeng Wu, Limin Xiao, and Li Ruan. 2012. A dynamic and adaptive load balancing strategy for parallel file system with large-scale I/O servers. Journal of Parallel and Distribed Computing 72, 10 (2012), 1254--1268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Amos Fiat, Anna Karlin, Elias Koutsoupias, and Angelina Vidali. 2013. Approaching utopia: Strong truthfulness and externality-resistant mechanisms. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science. ACM, 221--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y. Gao, Y. Chen, and K. J. R. Liu. 2012. Cooperation stimulation for multiuser cooperative communications using indirect reciprocity game. IEEE Transactions on Communications 60, 12 (2012), 3650--3661.Google ScholarGoogle ScholarCross RefCross Ref
  11. Davide Grossi and Paolo Turrini. 2010. Dependence theory via game theory. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: Volume 1. International Foundation for Autonomous Agents and Multiagent Systems, 1147--1154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Jian Guo, Fangming Liu, Dan Zeng, John Lui, and Hai Jin. 2013. A cooperative game based allocation for sharing data center networks. In INFOCOM, 2013 Proceedings IEEE. IEEE, 2139--2147.Google ScholarGoogle ScholarCross RefCross Ref
  13. Dong-Ki Kang, Seong-Hwan Kim, Chan-Hyun Youn, and Min Chen. 2014a. Cost adaptive workflow scheduling in cloud computing. In Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication. ACM, 65. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Seungmin Kang, Bharadwaj Veeravalli, and Khin Mi Mi Aung. 2014b. Scheduling multiple divisible loads in a multi-cloud system. In Proceedings of the 2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC’14). IEEE, 371--378. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Hamzeh Khazaei, Jelena Misic, and Vojislav Misic. 2013. A fine-grained performance model of cloud computing centers. IEEE Transactions on Parallel and Distributed Systems 24, 11 (2013), 2138--2147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Cinar Kilcioglu and Justin M Rao. 2016. Competition on price and quality in cloud computing. In Proceedings of the 25th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 1123--1132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Jörn Künsemöller and Holger Karl. 2012. A game-theoretical approach to the benefits of cloud computing. In Economics of Grids, Clouds, Systems, and Services. Springer, 148--160. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Keqin Li. 2013. Optimal load distribution for multiple heterogeneous blade servers in a cloud computing environment. Journal of Grid Computing 11, 1 (2013), 27--46. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Kenli Li, Chubo Liu, and Keqin Li. 2014. An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs. Theoretical Computer Science 543, 0 (2014), 46--51.Google ScholarGoogle ScholarCross RefCross Ref
  20. Na Li and J. R. Marden. 2011. Designing games for distributed optimization. In Proceedings of the 2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC’11). 2434--2440.Google ScholarGoogle Scholar
  21. C. Liu, K. Li, C. Xu, and K. Li. 2016. Strategy configurations of multiple users competition for cloud service reservation. IEEE Transactions on Parallel and Distributed Systems 27, 2 (2016), 508--520.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Dantong Liu, Yue Chen, Kok Keong Chai, and Tiankui Zhang. 2014. Nash bargaining solution based user association optimization in HetNets. In Proceedings of the 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC’14). IEEE, 587--592.Google ScholarGoogle Scholar
  23. Maggie Mashaly and Paul J. Kühn. 2012. Load balancing in cloud-based content delivery networks using adaptive server activation/deactivation. In Proceedings of the 2012 International Conference on Engineering and Technology (ICET’12). IEEE, 1--6.Google ScholarGoogle Scholar
  24. G. Mc Evoy and Bruno Schulze. 2011. Understanding scheduling implications for scientific applications in clouds. In Proceedings of the 9th International Workshop on Middleware for Grids, Clouds and e-Science. ACM, 3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. J. Mei, K. Li, A. Ouyang, and K. Li. 2015. A profit maximization scheme with guaranteed quality of service in cloud computing. IEEE Transactions on Computers PP, 99 (2015), 1--1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. R. Musku, A. T. Chronopoulos, D. C. Popescu, and A. Stefanescu. 2010. A game-theoretic approach to joint rate and power control for uplink CDMA communications. IEEE Transactions on Communications 58, 3 (2010), 923--932. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Martin J. Osborne and Ariel Rubinstein. 1994. A Course in Game Theory. MIT Press.Google ScholarGoogle Scholar
  28. Satish Penmatsa and Anthony T. Chronopoulos. 2011. Game-theoretic static load balancing for distributed systems. Journal of Parallel and Distributed Computing 71, 4 (2011), 537--555. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. M. M. Rana, Saurabh Bilgaiyan, and Utsav Kar. 2014. A study on load balancing in cloud computing environment using evolutionary and swarm based algorithms. In Proceedings of the 2014 International Conference on Control, Instrumentation, Communication and Computational Technologies (ICCICCT’14). IEEE, 245--250.Google ScholarGoogle ScholarCross RefCross Ref
  30. Nageswara S. V. Rao, Stephen W. Poole, Fei He, Jun Zhuang, Chris Y. T. Ma, and David K. Y. Yau. 2012. Cloud computing infrastructure robustness: A game theory approach. In Proceedings of the 2012 International Conference on Computing, Networking and Communications (ICNC’12). IEEE, 34--38.Google ScholarGoogle Scholar
  31. M. Elena Renda, Giovanni Resta, and Paolo Santi. 2012. Load balancing hashing in geographic hash tables. IEEE Transactions on Parallel and Distributed Systems 23, 8 (2012), 1508--1519. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. G. Scutari, D. P. Palomar, F. Facchinei, and Jong-Shi Pang. 2010. Convex optimization, game theory, and variational inequality theory. IEEE Signal Processing Magazine 27, 3 (May 2010), 35--49.Google ScholarGoogle ScholarCross RefCross Ref
  33. Gesualdo Scutari, Daniel P. Palomar, Francisco Facchinei, and Jong-Shi Pang. 2012. Monotone games for cognitive radio systems. In Distributed Decision Making and Control, Rolf Johansson and Anders Rantzer (Eds.). Lecture Notes in Control and Information Sciences, Vol. 417. Springer, London, 83--112.Google ScholarGoogle Scholar
  34. Aarti Singh, Dimple Juneja, and Manisha Malhotra. 2015. Autonomous agent based load balancing algorithm in cloud computing. Procedia Computer Science 45 (2015), 832--841.Google ScholarGoogle ScholarCross RefCross Ref
  35. R. Subrata, A. Y. Zomaya, and B. Landfeldt. 2008. A cooperative game framework for QoS guided job allocation schemes in grids. IEEE Transactions on Computers 57, 10 (2008), 1413--1422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. David R. M. Thompson and Kevin Leyton-Brown. 2013. Revenue optimization in the generalized second-price auction. In Proceedings of the 14th ACM Conference on Electronic Commerce. ACM, 837--852. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Cong Xu, Sahan Gamage, Pawan N. Rao, Ardalan Kangarlou, Ramana Rao Kompella, and Dongyan Xu. 2012. vSlicer: Latency-aware virtual machine scheduling via differentiated-frequency CPU slicing. In Proceedings of the 21st International Symposium on High-Performance Parallel and Distributed Computing. ACM, 3--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Xin Xu and Huiqun Yu. 2014. A game theory approach to fair and efficient resource allocation in cloud computing. Mathematical Problems in Engineering 2014 (2014).Google ScholarGoogle Scholar
  39. Haïkel Yaïche, Ravi R. Mazumdar, and Catherine Rosenberg. 2000. A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking (TON) 8, 5 (2000), 667--678. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bargaining Game-Based Scheduling for Performance Guarantees in Cloud Computing

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Modeling and Performance Evaluation of Computing Systems
      ACM Transactions on Modeling and Performance Evaluation of Computing Systems  Volume 3, Issue 1
      March 2018
      124 pages
      ISSN:2376-3639
      EISSN:2376-3647
      DOI:10.1145/3186330
      • Editors:
      • Sem Borst,
      • Carey Williamson
      Issue’s Table of Contents

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 13 February 2018
      • Accepted: 1 September 2017
      • Revised: 1 May 2017
      • Received: 1 May 2016
      Published in tompecs Volume 3, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader