Joint Switch Upgrade and Controller Deployment in Hybrid Software-Defined Networks

被引:49
作者
Guo, Zehua [1 ,2 ]
Chen, Weikun [3 ]
Liu, Ya-Feng [3 ]
Xu, Yang [4 ]
Zhang, Zhi-Li [2 ]
机构
[1] Beijing Inst Technol, Sch Automat, Beijing 100081, Peoples R China
[2] Univ Minnesota Twin Cities, Dept Comp Sci & Engn, Minneapolis, MN 55455 USA
[3] Chinese Acad Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci & Engn Comp, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[4] Fudan Univ, Sch Comp Sci, Shanghai 200433, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Complexity analysis; controller deployment; heuristic algorithm; hybrid software-defined networking (SDN); switch upgrade; upgrade budget; ASSIGNMENT; ALGORITHM; PLACEMENT; EFFICIENT;
D O I
10.1109/JSAC.2019.2906743
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To improve traffic management ability, Internet Service Providers (ISPs) are gradually upgrading legacy network devices to programmable devices that support Software-Defined Networking (SDN). The coexistence of legacy and SUN devices gives rise to a hybrid SDN. Existing hybrid SDNs do not consider the potential performance issues introduced by a centralized SDN controller: flow requests processed by a highly loaded controller may experience long-tail processing delay; inappropriate multi-controller deployment could increase the propagation delay of flow requests. In this paper, we propose to jointly consider the deployment of SDN switches and their controllers for hybrid SUNs. We formulate the joint problem as an optimization problem that maximizes the number of flows that can be controlled and managed by the SDN and minimizes the propagation delay of flow requests between SDN controllers and switches under a given upgrade budget constraint. We show this problem is NP-hard. To efficiently solve the problem, we propose some techniques (e.g., strengthening the constraints and adding additional valid inequalities) to accelerate the global optimization solver for solving the problem for small networks and an efficient heuristic algorithm for solving it for large networks. The simulation results from real network topologies illustrate the effectiveness of the proposed techniques and show that our proposed heuristic algorithm uses a small number of controllers to manage a high amount of flows with good performance.
引用
收藏
页码:1012 / 1028
页数:17
相关论文
共 51 条
[1]  
Agarwal S, 2013, IEEE INFOCOM SER, P2211
[2]  
[Anonymous], ZIB REP
[3]  
[Anonymous], P IND TRACK 13 ACM I
[4]  
[Anonymous], 2018, GUR OPT OPT REF MAN
[5]  
[Anonymous], P NETW DISTR SYST ND
[6]  
[Anonymous], LATEST BENCHMARK RES
[7]  
Caria M, 2015, PROCEEDINGS OF THE 2015 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM), P467, DOI 10.1109/INM.2015.7140324
[8]  
Cing-Yu Chu, 2015, 2015 IEEE Conference on Computer Communications (INFOCOM). Proceedings, P1086, DOI 10.1109/INFOCOM.2015.7218482
[9]   SOLVING LARGE-SCALE ZERO-ONE LINEAR-PROGRAMMING PROBLEMS [J].
CROWDER, H ;
JOHNSON, EL ;
PADBERG, M .
OPERATIONS RESEARCH, 1983, 31 (05) :803-834
[10]   The k-cardinality assignment problem [J].
DellAmico, M ;
Martello, S .
DISCRETE APPLIED MATHEMATICS, 1997, 76 (1-3) :103-121