Dynamic SDN Controller Load Balancing

被引:31
作者
Sufiev, Hadar [1 ]
Haddad, Yoram [1 ]
Barenboim, Leonid [2 ]
Soler, Jose [3 ]
机构
[1] Jerusalem Coll Technol, Dept Comp Sci, IL-91160 Jerusalem, Israel
[2] Open Univ Israel, IL-43107 Raanana, Israel
[3] Tech Univ Denmark DTU, DK-2800 Lyngby, Denmark
关键词
multi controllers; architecture; SDN; load balancing; SOFTWARE-DEFINED NETWORKING;
D O I
10.3390/fi11030075
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The software defined networking (SDN) paradigm separates the control plane from the data plane, where an SDN controller receives requests from its connected switches and manages the operation of the switches under its control. Reassignments between switches and their controllers are performed dynamically, in order to balance the load over SDN controllers. In order to perform load balancing, most dynamic assignment solutions use a central element to gather information requests for reassignment of switches. Increasing the number of controllers causes a scalability problem, when one super controller is used for all controllers and gathers information from all switches. In a large network, the distances between the controllers is sometimes a constraint for assigning them switches. In this paper, a new approach is presented to solve the well-known load balancing problem in the SDN control plane. This approach implies less load on the central element and meeting the maximum distance constraint allowed between controllers. An architecture with two levels of load balancing is defined. At the top level, the main component called Super Controller, arranges the controllers in clusters, so that there is a balance between the loads of the clusters. At the bottom level, in each cluster there is a dedicated controller called Master Controller, which performs a reassignment of the switches in order to balance the loads between the controllers. We provide a two-phase algorithm, called Dynamic Controllers Clustering algorithm, for the top level of load balancing operation. The load balancing operation takes place at regular intervals. The length of the cycle in which the operation is performed can be shorter, since the top-level operation can run independently of the bottom level operation. Shortening cycle time allows for more accurate results of load balancing. Theoretical analysis demonstrates that our algorithm provides a near-optimal solution. Simulation results show that our dynamic clustering improves fixed clustering by a multiplicative factor of 5.
引用
收藏
页数:21
相关论文
共 31 条
[1]  
[Anonymous], 2013, Introduction to Analytic Number Theory
[2]  
[Anonymous], 1996, Approximation algorithms for NP-hard problems
[3]  
Auroux S, 2015, 2015 EUROPEAN CONFERENCE ON NETWORKS AND COMMUNICATIONS (EUCNC), P144, DOI 10.1109/EuCNC.2015.7194057
[4]  
Bari MF, 2013, INT CONF NETW SER, P18, DOI 10.1109/CNSM.2013.6727805
[5]   Distributed Hierarchical Control Plane of Software Defined Networking [J].
Bhole, Prashant D. ;
Puri, Dinesh D. .
2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS (CICN), 2015, :516-522
[6]   ElastiCon: An Elastic Distributed SDN Controller [J].
Dixit, Advait ;
Hao, Fang ;
Mukherjee, Sarit ;
Lakshman, T. V. ;
Kompella, Ramana Rao .
TENTH 2014 ACM/IEEE SYMPOSIUM ON ARCHITECTURES FOR NETWORKING AND COMMUNICATIONS SYSTEMS (ANCS'14), 2014, :17-27
[7]   Towards an Elastic Distributed SDN Controller [J].
Dixit, Advait ;
Hao, Fang ;
Mukherjee, Sarit ;
Lakshman, T. V. ;
Kompella, Ramana .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2013, 43 (04)
[8]   A Hybrid Hierarchical Control Plane for Flow-Based Large-Scale Software-Defined Networks [J].
Fu, Yonghong ;
Bi, Jun ;
Chen, Ze ;
Gao, Kai ;
Zhang, Baobao ;
Chen, Guangxu ;
Wu, Jianping .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2015, 12 (02) :117-131
[9]  
Görkemli B, 2016, 2016 IEEE NETSOFT CONFERENCE AND WORKSHOPS (NETSOFT), P68, DOI 10.1109/NETSOFT.2016.7502445
[10]   The Controller Placement Problem [J].
Heller, Brandon ;
Sherwood, Rob ;
McKeown, Nick .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :473-478