Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 2016, Article ID 1629893, 13 pages
http://dx.doi.org/10.1155/2016/1629893
Research Article

A Game-Theoretic Based Resource Allocation Strategy for Cloud Computing Services

1College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning 110819, China
2College of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuangdao, Hebei 066004, China

Received 9 May 2016; Revised 14 August 2016; Accepted 23 August 2016

Academic Editor: Jun Zheng

Copyright © 2016 Wang Yan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Nim and A. Anandasivam, “SORMA-business cases for an open grid market: concept and implementation,” in Proceedings of the 5th International Workshop on Grid Economics and Business Models, pp. 173–184, August 2003.
  2. A. J. Younge and Z. Wang, “Efficient resource management for cloud computing environments,” in Proceedings of the Green Computing International Conference, pp. 357–364, August 2010. View at Publisher · View at Google Scholar
  3. W. Yang, Z. Peng, L. Dong, Z. Hualiang, and Y. Haibin, “A performance modeling of decentralized cloud computing based on multiple M/M/m/m+m queuing systems,” Acta Electronica Sinca, vol. 42, no. 10, pp. 2055–2059, 2015. View at Google Scholar
  4. G. Ping and B. Ling-ling, “The resource management model for cloud computing based on electronics,” in Proceedings of the Electrical & Electronics Engineering (EEESYM '12), pp. 471–474, Kuala Lumpur, Malaysia, June 2012.
  5. R. J. Al-Ali, K. Amin, G. V. Laszewski et al., “Scheduling independent multiprocessor tasks,” Journal of Grid Computing, vol. 2, no. 2, pp. 163–182, 2004. View at Publisher · View at Google Scholar
  6. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, “Scheduling independent multiprocessor tasks,” Algorithmica, vol. 32, no. 2, pp. 247–261, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  7. S. Borst, O. Boxma, J. F. Groote, and S. Mauw, “Task allocation in a multi-server system,” Journal of Scheduling, vol. 6, no. 5, pp. 423–436, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, “Economic models for resource management and scheduling in grid computing,” Concurrency and Computation: Practice and Experience, vol. 14, no. 13–15, pp. 1507–1542, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Doğan and F. Özgüner, “Scheduling independent tasks with QoS requirements in grid computing with time-varying resource prices,” in Proceedings of the 3rd International Workshop on Grid Computing, Baltimore, Md, USA, November 2002, vol. 2536, pp. 58–69, Springer, 2002. View at Google Scholar
  10. M. A. Iverson, F. Özgüner, and L. Potter, “Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment,” IEEE Transactions on Computers, vol. 48, no. 12, pp. 1374–1379, 1999. View at Publisher · View at Google Scholar · View at Scopus
  11. L. Keqin, “Experimental performance evaluation of job scheduling and processor allocation algorithms for grid computing on metacomputers,” in Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS '04), pp. 170–177, Santa Fe, NM, USA, April 2004. View at Publisher · View at Google Scholar
  12. K. Ranganathan, M. Ripeanu, A. Sarin, and I. Foster, “Incentive mechanisms for large collaborative resource sharing,” in Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid '04), pp. 1–8, IEEE, Chicago, Ill, USA, April 2004. View at Scopus
  13. R. Wolski, J. S. Plank, T. Bryan, and J. Brevik, “G-commerce: market formulations controlling resource allocation on the computational grid,” in Proceedings of the 15th International Parallel and Distributed Processing Symposium, pp. 46–52, April 2000. View at Publisher · View at Google Scholar
  14. J. K. Lenstra, D. B. Shmoys, and É. Tardos, “Approximation algorithms for scheduling unrelated parallel machines,” Mathematical Programming, vol. 46, no. 1, pp. 259–271, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. G. Christodoulou, E. Koutsoupias, and A. Vidali, “A lower bound for scheduling mechanisms,” Algorithmica, vol. 55, no. 4, pp. 729–740, 2009. View at Publisher · View at Google Scholar
  16. C. Askarian, “A survey for load balancing in mobile WiMAX networks,” Advanced Computing, vol. 3, no. 2, pp. 119–137, 2012. View at Publisher · View at Google Scholar
  17. D. Gkantsidis, O. Vytiniotis, D. Hodson, F. Narayanan Dinu, and A. Rowstron, “Rhea: automatic filtering for unstructured cloud storage,” in Proceedings of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI '13), vol. 106, no. 40, pp. 343–355, Lombard, Ill, USA, 2013.
  18. Y. Dongmei and L. Chenghua, “Optimized collaborative filtering recommendation based on users' interest degree and feature,” Application Research of Computers, vol. 29, no. 2, pp. 497–500, 2012. View at Google Scholar
  19. H. Guodong, Z. Yige, and Z. Fan, “A dynamic replica placement approach based on cognition,” Computer Applications and Soft, vol. 30, no. 1, pp. 83–87, 2013. View at Google Scholar
  20. L. Wang, J. Luo, J. Shen, and F. Dong, “Cost and time aware ant colony algorithm for data replica in alpha magnetic spectrometer experiment,” in Proceedings of the IEEE International Congress on Big Data (BigData Congress '13), pp. 247–254, Santa Clara, Calif, USA, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Yuan, Y. Yang, X. Liu et al., “A highly practical approach toward achieving minimum data sets storage cost in the cloud,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 6, pp. 1234–1244, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. Dong and M. Wang, Game Theory, National Development and Reform Commission, Beijing, China, 2nd edition, 2008.
  23. Y.-K. Kwok, K. Hwang, and S. Song, “Selfish grids: game-theoretic modeling and NAS/PSA benchmark evaluation,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 5, pp. 621–636, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. A. H. Elghirani, R. Subrata, and A. Y. Zomaya, “A proactive non-cooperative game-theoretic framework for data replication in data grids,” in Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, pp. 433–440, May 2008.
  25. P. Ghosh, N. Roy, S. K. Das, and K. Basu, “A pricing strategy for job allocation in mobile grids using a non-cooperative bargaining theory framework,” Journal of Parallel and Distributed Computing, vol. 65, no. 11, pp. 1366–1383, 2005. View at Publisher · View at Google Scholar · View at Scopus
  26. C.-L. Li, D. Liao, L. Xiong, and Y.-J. Huang, “A service selection algorithm based on quantified QoE evaluation,” Acta Electronica Sinica, vol. 43, no. 11, pp. 2145–2150, 2015. View at Publisher · View at Google Scholar · View at Scopus