Strategy Configurations of Multiple Users Competition for Cloud Service Reservation
Strategy Configurations of Multiple Users Competition for Cloud Service Reservation
复制标题
多用户竞争云服务预约策略配置
DOI：
10.1109/tpds.2015.2398435
复制
发表时间：
2016-02-01
影响因子：
5.3
通讯作者：
Li, Keqin
中科院分区：
文献类型：
--
作者：
Liu, Chubo;Li, Kenli;Li, Keqin
在本文中，我们专注于多个用户的策略配置，以进行云服务保留。我们从游戏理论的角度考虑了问题，并将其提出为多个云用户中的非合作游戏，其中每个用户都会通知其他用户的不完整信息。对于每个用户，我们设计一个将净利润与时间效率相结合的实用程序功能，并尝试最大化其价值。我们通过采用变异不平等（VI）理论来解决该问题，并证明为配方游戏设置了NASH平衡解决方案。然后，我们提出了一种迭代近端算法（IPA），该算法旨在计算NASH平衡溶液。还分析了IPA算法的收敛性，如果满足了几种条件，我们发现它会收敛到NASH平衡。最后，我们进行了一些数值计算以验证我们的理论分析。实验结果表明，我们提出的IPA算法非常快速地收敛到稳定状态，并通过配置适当的请求策略来一定程度地改善所有用户的实用程序。
In this paper, we focus on strategy configurations of multiple users to make cloud service reservation. We consider the problem from a game theoretic perspective and formulate it into a non-cooperative game among the multiple cloud users, in which each user is informed with incomplete information of other users. For each user, we design a utility function which combines the net profit with time efficiency and try to maximize its value. We solve the problem by employing variational inequality (VI) theory and prove that there exists a Nash equilibrium solution set for the formulated game. Then, we propose an iterative proximal algorithm (IPA), which is designed to compute a Nash equilibrium solution. The convergence of the IPA algorithm is also analyzed and we find that it converges to a Nash equilibrium if several conditions are satisfied. Finally, we conduct some numerical calculations to verify our theoretical analysis. The experimental results show that our proposed IPA algorithm converges to a stable state very quickly and improves the utilities of all users to certain extent by configuring a proper request strategy.