Simulated annealing based optimal controller placement in software defined networks with capacity constraint and failure awareness

Abstract

Software Defined Networking is an evolving network model wherein the control plane is decoupled from data plane. It has become a fascinating problem to decide the number of controllers and their positions, and to allocate switches to them. Each switch must be assigned to a backup controller so that if a controller encounters failure then the switches which are assigned to it can be immediately connected to their backup controllers. An existing method attempts to solve this problem by employing mixed integer linear programming; but it suffers from huge increase in execution time for larger networks. In order to reduce the execution time, this paper proposes a simulated annealing-based heuristic which aims to minimize the maximum of latencies from all switches to the respective backup controllers. The proposed algorithm is evaluated on seven real networks of varying sizes from Internet Topology Zoo and its performance is compared with the existing model. The results show that the proposed model achieves an average speed-up of 2.5 over the existing model (for the smallest network) and an average speed-up of 280 over the existing model (for the largest network). And at the same time, the proposed model produces near optimal solution.

Keywords

• Software defined network
• Latency
• Controller placement
• Simulated annealing
• Optimization