Fair Network Bandwidth Allocation in IaaS Datacenters via a Cooperative Game Approach

被引:76
作者
Guo, Jian [1 ]
Liu, Fangming [1 ]
Lui, John C. S. [2 ]
Jin, Hai [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Serv Comp Technol & Syst Lab, Cluster & Grid Comp Lab, Wuhan 430074, Peoples R China
[2] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Bandwidth allocation; fairness; Infrastructure-as-a-Service (IaaS) datacenter; Nash bargaining solution;
D O I
10.1109/TNET.2015.2389270
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With wide application of virtualization technology, tenants are able to access isolated cloud services by renting the shared resources in Infrastructure-as-a-Service (IaaS) datacenters. Unlike resources such as CPU and memory, datacenter network, which relies on traditional transport-layer protocols, suffers unfairness due to a lack of virtual machine (VM)-level bandwidth guarantees. In this paper, we model the datacenter bandwidth allocation as a cooperative game, toward VM-based fairness across the datacenter with two main objectives: 1) guarantee bandwidth for VMs based on their base bandwidth requirements, and 2) share residual bandwidth in proportion to the weights of VMs. Through a bargaining game approach, we propose a bandwidth allocation algorithm, Falloc, to achieve the asymmetric Nash bargaining solution (NBS) in datacenter networks, which exactly meets our objectives. The cooperative structure of the algorithm is exploited to develop an online algorithm for practical real-world implementation. We validate Falloc with experiments under diverse scenarios and show that by adapting to different network requirements of VMs, Falloc can achieve fairness among VMs and balance the tradeoff between bandwidth guarantee and proportional bandwidth sharing. Our large-scale trace-driven simulations verify that Falloc achieves high utilization while maintaining fairness among VMs in datacenters.
引用
收藏
页码:873 / 886
页数:14
相关论文
共 26 条
[1]  
[Anonymous], 2013, P USENIX NSDI
[2]   Towards Predictable Datacenter Networks [J].
Ballani, Hitesh ;
Costa, Paolo ;
Karagiannis, Thomas ;
Rowstron, Ant .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2011, 41 (04) :242-253
[3]  
BOCHE H, 2007, P 15 EUR SIGN PROC C
[4]  
Boyd S, 2004, CONVEX OPTIMIZATION
[5]   Interactive Analytical Processing in Big Data Systems: A Cross-Industry Study of MapReduce Workloads [J].
Chen, Yanpei ;
Alspaugh, Sara ;
Katz, Randy .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (12) :1802-1813
[6]  
Greenberg A, 2009, SIGCOMM 2009, P51
[7]  
Guo C., 2010, P 6 INT C, P15
[8]  
Guo J, 2014, IEEE INFOCOM SER, P1572, DOI 10.1109/INFOCOM.2014.6848093
[9]  
Guo J, 2013, IEEE INFOCOM SER, P2139
[10]   3D Object Classification based on Local Keywords and Hidden Markov Model [J].
Guo Jing ;
Zhou Mingquan ;
Li Chao .
2013 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL MANUFACTURING AND AUTOMATION (ICDMA), 2013, :1-4