Contact Project Developer Ashish D. Tiwari [astiwz@gmail.com]
Download Synopsis Abstract
C#.NET ASP.NET JSP Networking BE-Engineering(CO/IT) ME-Engineering(CO/IT) BCS MCS BCA MCA MCM BSC Computer/IT MSC Computer/IT Diploma (CO/IT) IEEE-2016

Strategy Configurations of Multiple Users Competition for Cloud Service Reservation

In this paper, we focus on strategy configurations of multiple users to make cloud service reservation.
Abstract-Synopsis-Documentation

Abstract

In this paper, we focus on strategy configurations of multiple users to make cloud service reservation. We consider theproblem from a game theoretic perspective and formulate it into a non-cooperative game among the multiple cloud users, in which eachuser is informed with incomplete information of other users. For each user, we design a utility function which combines the net profitwith time efficiency and try to maximize its value. We solve the problem by employing variational inequality (VI) theory and prove thatthere exists a Nash equilibrium solution set for the formulated game. Then, we propose an iterative proximal algorithm (IPA), which isdesigned to compute a Nash equilibrium solution. The convergence of the IPA algorithm is also analyzed and we find that it convergesto a Nash equilibrium if several conditions are satisfied. Finally, we conduct some numerical calculations to verify our theoreticalanalysis. The experimental results show that our proposed IPA algorithm converges to a stable state very quickly and improves theutilities of all users to certain extent by configuring a proper request strategy.

View More...



Comment is Only Available for registered users! Create Account or Login Now!