A Hierarchical Distributed Control Plane for Path Computation Scalability in Large Scale Software-Defined Networks

2019 ◽  
Vol 16 (3) ◽  
pp. 1019-1031 ◽  
Author(s):  
Mohammed Amine Togou ◽  
Djabir Abdeldjalil Chekired ◽  
Lyes Khoukhi ◽  
Gabriel-Miro Muntean
2019 ◽  
Vol 37 (8) ◽  
pp. 1755-1768 ◽  
Author(s):  
Kun Qiu ◽  
Jin Zhao ◽  
Xin Wang ◽  
Xiaoming Fu ◽  
Stefano Secci

2015 ◽  
Vol 12 (2) ◽  
pp. 117-131 ◽  
Author(s):  
Yonghong Fu ◽  
Jun Bi ◽  
Ze Chen ◽  
Kai Gao ◽  
Baobao Zhang ◽  
...  

2019 ◽  
Vol 26 (1) ◽  
pp. 101-121
Author(s):  
Vasily N. Pashkov

The architecture of the high availability distributed control plane for SDN/OpenFlow networks are considered. High availability is achieved by redundancy of controller instances, active switch-controller communications, computing resources and tools for a controller instance failure and overloading detection and recovery. The proactive backup controller allocation algorithm which allows to minimize the time to repair in the case of a single controller instance failure is discussed. The algorithm for controller load-balancing allows dynamically reconfigure the control plane with a minimum number of switch control transfer operations to avoid controller instance overloading. The initial experimental results of the proposed algorithms for the HA distributed SDN control plane are described.


2020 ◽  
Vol 17 (1) ◽  
pp. 228-233
Author(s):  
C. N. Sminesh ◽  
E. Grace Mary Kanaga ◽  
A. G. Sreejish

Software Defined Networks (SDN) divide network intelligence and packet forwarding functionalities between control plane and data plane devices respectively. Multiple controllers need to be deployed in the control plane in large SDN networks to improve performance and scalability. In a multi-controller scenario, finding the adequate number of controllers and their load distribution are open research challenges. In a large-scale network, the control plane load balancing is termed a controller placement problem (CPP). It is observed that of the existing solutions for the CPP, clustering-based approaches provide computationally less intensive solutions. The proposed augmented affinity propagation (augmented-AP) clustering identifies the required number of network partitions and places the controllers such that the distribution of switches to the controller is much better than with existing algorithms. The simulation results show that the computed controller imbalance factor of augmented-AP algorithm outperforms the existing k-means algorithm.


ROBOT ◽  
2011 ◽  
Vol 33 (4) ◽  
pp. 434-439 ◽  
Author(s):  
Dangyang JIE ◽  
Fenglei NI ◽  
Yisong TAN ◽  
Hong LIU ◽  
Hegao CAI

Sign in / Sign up

Export Citation Format

Share Document