A fault tolerance metaheuristic-based scheme for controller placement problem in wireless software-defined networks

被引:14
作者
Samarji, Nivine [1 ]
Salamah, Muhammed [1 ]
机构
[1] Eastern Mediterranean Univ, Dept Comp Engn, Via Mersin 10, TR-99450 Gazimagusa, Cyprus
关键词
controller placement problem; metaheuristic algorithm; network performance; NSGA‐ II; optimization; software‐ defined networking;
D O I
10.1002/dac.4624
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Software-defined networking (SDN) paradigm has become the master solver for traditional network restrictions. The fundamental concept of SDN is moving the control plane into one or more servers called controllers and confining the data plane to several forwarding network elements allowing dynamic and flexible network management. A critical challenging issue in SDN-based network architecture is the controller placement problem (CPP) that is an NP-hard problem. Trends of researches try solving the CPP based on evolutionary algorithms focusing on either propagation delay or balancing the load among distributed controllers. In this paper, we have proposed a fault tolerance metaheuristic-based scheme for CPP in wireless software-defined networks, named FTMBS. The aim of our proposed FTMBS scheme is as follows: maximizing the network connectivity, maximizing the load balance among controllers, minimizing the worst-case latency between controllers and associated nodes and between controllers themselves, and maximizing the network lifetime. When dealing with a multi-objective-based scheme, a trade-off exists mainly when these multi-objective metrics compete with each other, and it will be up to the decision maker to decide on this trade-off. We have considered a network of 500 randomly distributed sensor nodes and demonstrated various simulations for different network performance metrics and concluded that three controllers are enough for such networks. For performance evaluation, we have verified our solutions to be close to Pareto optimal ones provided by non-dominated sorting genetic algorithm-II (NSGA-II).
引用
收藏
页数:22
相关论文
共 46 条
[1]  
[Anonymous], 2016, ASIA PAC NETW OPER M
[2]  
[Anonymous], 2011, GLOB TELECOMM CONF
[3]  
Bhajantri Lokesh B., 2014, International Journal of Computer Network and Information Security, V6, P37, DOI 10.5815/ijcnis.2014.12.05
[4]  
Champagne S, 2018, GEN EV COMP C GECCO
[5]  
Cisco, 2014, CISC APPL POL INFR C
[6]  
Costanzo S, 2012, P 2012 EUR WORKSH SO
[7]   A Load-Balancing Mechanism for Distributed SDN Control Plane Using Response Time [J].
Cui, Jie ;
Lu, Qinghe ;
Zhong, Hong ;
Tian, Miaomiao ;
Liu, Lu .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (04) :1197-1206
[8]  
de Oliveira BT, 2015, IEEE LAT AM T, V13, P3690
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   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