Multi-Resource Load Balancing for Virtual Network Functions

被引:48
作者
Wang, Tao [1 ]
Xu, Hong [2 ]
Liu, Fangming [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Minist Educ, Key Lab Serv Comp Technol & Syst, Wuhan, Hubei, Peoples R China
[2] City Univ Hong Kong, NetX Lab, Hong Kong, Hong Kong, Peoples R China
来源
2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017) | 2017年
关键词
D O I
10.1109/ICDCS.2017.233
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Middleboxes are widely deployed to perform various network functions to ensure security and improve performance. The recent trend of Network Function Virtualization (NFV) makes it easy for operators to deploy software implementations of these network functions on commodity servers. However, virtual network functions consume different amounts of resources when processing packets. Thus a multi-resource load balancing (MRLB) mechanism is needed to efficiently utilize server resources. MRLB problem in the context of NFV is fundamentally different from multi-resource allocation problems, as well as traditional single-resource load balancing and multi-resource load balancing problems in task scheduling. In this paper, we tackle the MRLB problem in NFV by first proposing dominant load the load of the most stressed resource on a server as the load balancing metric. We then formulate the MRLB problem as an optimization to minimize the maximum dominant load of all NFV servers given the demand. Based on proximal Jacobian ADMM, we propose an efficient algorithm to solve the problem in large scale settings. Through extensive trace-driven simulations and prototype experiments on a testbed, we show that our MRLB algorithm with dominant load performs significantly better and faster than benchmarking algorithms.
引用
收藏
页码:1322 / 1332
页数:11
相关论文
共 29 条
[1]  
[Anonymous], 2013, ARXIV13085294
[2]  
[Anonymous], P IEEE ICDCS
[3]  
[Anonymous], 2012, ACM S CLOUD COMPUTIN
[4]  
[Anonymous], ARXIV13123040
[5]  
[Anonymous], 2014, Proc. ACM SIGCOMM
[6]  
[Anonymous], 2011, FDN TRENDS MACHINE L
[7]  
[Anonymous], 2014, P 11 USENIX C NETW S
[8]  
[Anonymous], 2013, P IEEE INFOCOM
[9]  
Benson T., 2010, P ACM IMC
[10]  
Chekuri C., 2004, SIAM J COMPUTING