A game-theoretic method of fair resource allocation for cloud computing services
A game-theoretic method of fair resource allocation for cloud computing services
复制标题
云计算服务公平资源分配的博弈论方法
DOI：
10.1007/s11227-009-0318-1
复制
发表时间：
2010-11-01
影响因子：
3.3
通讯作者：
Xiong, Naixue
中科院分区：
文献类型：
--
作者：
Wei, Guiyi;Vasilakos, Athanasios V.;Xiong, Naixue
随着基于云的服务变得越来越多和动态，资源供应变得越来越具有挑战性。本文考虑了一个QoS约束的资源分配问题，服务需求者通过请求使用云网络上的资源来解决复杂的并行计算问题，每个计算服务的成本取决于计算量.博弈论是用来解决资源分配问题的。提出了一个实用的近似解决方案与以下两个步骤。首先，每个参与者独立地解决其最优问题，而不考虑资源分配的复用。提出了一种求解独立优化问题的二进制规划方法。其次，设计了一种进化机制，以最小化各参与者的效率损失为目标，改变不同参与者初始最优解的复用策略。进化机制中的算法兼顾了优化和公平性。证明了当资源分配博弈存在可行解时，纳什均衡总是存在的。
As cloud-based services become more numerous and dynamic, resource provisioning becomes more and more challenging. A QoS constrained resource allocation problem is considered in this paper, in which service demanders intend to solve sophisticated parallel computing problem by requesting the usage of resources across a cloud-based network, and a cost of each computational service depends on the amount of computation. Game theory is used to solve the problem of resource allocation. A practical approximated solution with the following two steps is proposed. First, each participant solves its optimal problem independently, without consideration of the multiplexing of resource assignments. A Binary Integer Programming method is proposed to solve the independent optimization. Second, an evolutionary mechanism is designed, which changes multiplexed strategies of the initial optimal solutions of different participants with minimizing their efficiency losses. The algorithms in the evolutionary mechanism take both optimization and fairness into account. It is demonstrated that Nash equilibrium always exists if the resource allocation game has feasible solutions.