a new set covering controller placement problem model for large scale sdns

Software defined network (sdn) is an emerging architecture that can overcome the challenges facing traditional networks. sdn enables administrator/operator to build a simpler and manageable network. new sdn paradigms are encouraged to deploy multiple (rather than centralized) controllers to monitor the entire network. the controller placement problem is one of the key issues in sdn that affect all its aspects including scalability, convergence time, fault tolerance, and node to controller latency. many researchers focus on solving this problem by trying to optimize the location of an arbitrary number of controllers. the related works in this area get less attention to two following important issues: i) bidirectional end-to-end latency between the switch and its controller instead of propagation latency and ii) finding the minimal number of controllers, which is a prerequisite for locating them. in this paper, we propose a set covering controller placement problem model (sccppm) in order to find the least number of required controllers with respect to carrier-grade latency requirement. the proposed model is carried out on a set of 124 graphs from the internet topology zoo and solve them with ibm ilog cplex optimization package. our results indicate that the number of required controllers for high resilient network is dependent on topology and network size. moreover, to achieve carrier-grade requirement, 86% of topologies must have more than one controller.