当前位置: X-MOL 学术IEEE Trans. Cloud Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Distributed Resource Allocation for Data Center Networks: A Hierarchical Game Approach
IEEE Transactions on Cloud Computing ( IF 6.5 ) Pub Date : 2018-01-01 , DOI: 10.1109/tcc.2018.2829744
Huaqing Zhang , Yong Xiao , Shengrong Bu , Richard Yu , Dusit Niyato , Zhu Han

The increasing demand of data computing and storage for cloud-based services motivates the development and deployment of large-scale data centers. This paper studies the resource allocation problem for the data center networking system when multiple data center operators (DCOs) simultaneously serve multiple service subscribers (SSs). We formulate a hierarchical game to analyze this system where the DCOs and the SSs are regarded as the leaders and followers, respectively. In the proposed game, each SS selects its serving DCO with preferred price and purchases the optimal amount of resources for the SS's computing requirements. Based on the responses of the SSs’ and the other DCOs’, the DCOs decide their resource prices so as to receive the highest profit. When the coordination among DCOs is weak, we consider all DCOs are noncooperative with each other, and propose a sub-gradient algorithm for the DCOs to approach a sub-optimal solution of the game. When all DCOs are sufficiently coordinated, we formulate a coalition game among all DCOs and apply Kalai-Smorodinsky bargaining as a resource division approach to achieve high utilities. Both solutions constitute the Stackelberg Equilibrium. The simulation results verify the performance improvement provided by our proposed approaches.

中文翻译:

数据中心网络的分布式资源分配:一种分层博弈方法

对基于云的服务的数据计算和存储需求不断增长,推动了大规模数据中心的开发和部署。本文研究了当多个数据中心运营商 (DCO) 同时为多个服务用户 (SS) 服务时数据中心网络系统的资源分配问题。我们制定了一个分层游戏来分析这个系统,其中 DCO 和 SS 分别被视为领导者和追随者。在提议的游戏中,每个 SS 选择其服务的 DCO 并以首选价格购买最佳数量的资源以满足 SS 的计算需求。根据 SS 和其他 DCO 的反应,DCO 决定他们的资源价格,以获得最高的利润。当 DCO 之间的协调较弱时,我们认为所有 DCO 之间都是不合作的,并为 DCO 提出了一种次梯度算法来逼近博弈的次优解。当所有 DCO 充分协调时,我们在所有 DCO 之间制定联盟博弈,并应用 Kalai-Smorodinsky 讨价还价作为资源分配方法来实现高效用。两种解都构成了斯塔克尔伯格均衡。仿真结果验证了我们提出的方法提供的性能改进。
更新日期:2018-01-01
down
wechat
bug