Research Article
Achieving Application-Level Utility Max-Min Fairness of Bandwidth Allocation in Datacenter Networks
@INPROCEEDINGS{10.1007/978-3-319-28910-6_4, author={Wangying Ye and Fei Xu and Wei Zhang}, title={Achieving Application-Level Utility Max-Min Fairness of Bandwidth Allocation in Datacenter Networks}, proceedings={Collaborative Computing: Networking, Applications, and Worksharing. 11th International Conference, CollaborateCom 2015, Wuhan, November 10-11, 2015, China. Proceedings}, proceedings_a={COLLABORATECOM}, year={2016}, month={2}, keywords={Bandwidth allocation Max-min fairness Application utility Datacenter networking}, doi={10.1007/978-3-319-28910-6_4} }- Wangying Ye
Fei Xu
Wei Zhang
Year: 2016
Achieving Application-Level Utility Max-Min Fairness of Bandwidth Allocation in Datacenter Networks
COLLABORATECOM
Springer
DOI: 10.1007/978-3-319-28910-6_4
Abstract
Providing fair bandwidth allocation for applications is becoming increasingly compelling in cloud datacenters as different applications compete for shared datacenter network resources. Existing solutions mainly provide bandwidth guarantees for virtual machines (VMs) and achieve the fairness of VM bandwidth allocation. However, scant attention has been paid to application bandwidth guarantees for the . In this paper, we introduce a rigorous definition of , which guides us to develop a non-linear model to investigate the relationship between the fairness of application performance (utility) and the application bandwidth allocation. Based on Newton’s method, we further design a simple yet effective algorithm to solve this problem, and evaluate its effectiveness with extensive experiments using OpenFlow in Mininet virtual network environment. Evaluation results show that our algorithm can achieve utility max-min fair share of bandwidth allocation for applications in datacenter networks, yet with an acceptable computational overhead.