An efficient approach to robust controller placement for link failures in Software-Defined Networks

Abstract

In Software-Defined Networks (SDN), one of the critical research challenges for large-scale deployment of SDN is controller placement problem (CPP). However, link failures are critical security issues in networks and greatly impact SDN’s robustness. The CPP for link failures is still challenging today. To this end, we study the CPP for multi-link failures (CPP-MLF). Firstly, we investigate the real link data of today’s networks to analyze the characteristics of link failures and formalize the link failure rate. Next, we formulate minimizing the number of controllers and worst-case delay as the optimization objectives of CPP-MLF and develop a heuristic algorithm based on improved NSGA-II to solve CPP-MLF efficiently. Specifically, we improve the non-dominated set and crowding distance for the NSGA-II by dynamic competition mechanism and even distribution operator, respectively, thereby quickly obtaining the Pareto-optimal solutions of CPP-MLF. Afterwards, we introduce controller load variance to evaluate them to make a satisfactory decision on controller placement. We conduct simulations with real network topologies, and the results show that the proposed heuristic algorithm performs well on the number of controllers, worst-case delay and robustness, while producing acceptable runtime overheads.