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.

Additional Metadata
Keywords Analytical models, Cloud computing, Computational modeling, Data center, Data centers, Delays, game theory, Games, hierarchical game, Resource management, resource management
Persistent URL
Journal IEEE Transactions on Cloud Computing
Zhang, H. (Huaqing), Xiao, Y. (Yong), Bu, S. (Shengrong), Yu, F.R, Niyato, D. (Dusit), & Han, Z. (Zhu). (2018). Distributed Resource Allocation for Data Center Networks: A Hierarchical Game Approach. IEEE Transactions on Cloud Computing. doi:10.1109/TCC.2018.2829744