Resource Provision Scheduling in Cloud using Game Theory

Authors

  • Kaur G Department of Computer Science and Applications, Panjab University, Chandigarh, India

DOI:

https://doi.org/10.26438/ijcse/v7i9.4953

Keywords:

Cloud Computing, Resource Allocation, Game Theory, Auction, Nash Equilibrium

Abstract

In cloud computing environment, resource allocation problem identifies that the cloud provider expects profit and the users expects best resources by considering budget and time constraints. In this paper, game theory mechanism has been used and an auction-based method is proposed which determines the auction winner and holding a repetitive game with incomplete information in a non-cooperative environment. In the proposed method, users calculate suitable price bid with their objective function during several round and repetitions and send it to the auctioneer; and the auctioneer chooses the winning player based on the suggested utility function. In the proposed technique, the end point of the game is the Nash equilibrium point where players are no longer inclined to alter their bid for that resource and the concluding bid also satisfies the auctioneer’s utility function. The proposed model is simulated in the Cloudsim and the results are compared with previous work.

References

[1]Parsa S., Shokri A., and Nourossana S., “A novel market-based grid resource allocation algorithm”, International Conference on Network Digital Technologies, Tehran, Iran,2009.

[2]R.Wolski, J.Brevik, J.S.Plank and T. Bryan, “Grid resource allocation and control using computational economics”, Berman F., Fox G., and Hey A., editors, Grid Computing: Making The Global Infrastructure a Reality, John Wiley & Sons, 2003.

[3]Izakian H., Abraham Ajith and Ladani T.B., “An Auction Method for Resource Allocation in Computational Grids”, Future Generation Computer Systems, 26(2): 228-235, 201.

[4]Das Anubhav and Grosu Daniel, “Combinatorial Auction-based Protocols for Resource Allocation in Grids”, 19th IEEE International Symposium on Parallel and Distributed processing (IPDPS’05) – Workshop 13, Vol. 14, 2005.

[5]Wang X., Teo Y.M. and Gozali J.P., “A Compensation-based Scheduling Scheme for Grid Computing”, In Proceedings of the Seventh International Conference on High Performance Computing and Grids in Asia pacific Region, 2004.

[6]N.Nisan, Algorithmic Game Theory, Cambridge University Press, 2007. View at MathSciNet.

[7] M. J. Osborne, An Introduction to Game Theory, vol. 3, Oxford University Press, New York, NY, USA, 2004.

[8]Y.Shoham,“Computer science and game theory,” Communications of the ACM, vol. 51, no. 8, pp. 75–79, 2008. View at Publisher • View at Google Scholar • View at Scopus.

[9] L. Guijarro, V. Pla, J. R. Vidal, and J. Martinez-Bauset, “Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model,” Mathematical Problems in Engineering, vol. 2012, Article ID 620972, 13 pages, 2012. View at Publisher • View at Google Scholar • View at Zentralblatt MATH.

[10]Wei-Yu Lin, Guan-Yu Lin, Hung-Yu Wei, “Dynamic Auction Mechanism for Cloud Resource Allocation”, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

Downloads

Published

2019-09-30
CITATION
DOI: 10.26438/ijcse/v7i9.4953
Published: 2019-09-30

How to Cite

[1]
G. Kaur, “Resource Provision Scheduling in Cloud using Game Theory”, Int. J. Comp. Sci. Eng., vol. 7, no. 9, pp. 49–53, Sep. 2019.

Issue

Section

Research Article