Performance Analysis of Controller Placement Algorithm in Software Defined Networks

摘要

Software Defined Networking (SDN) has caused a paradigm shift in communication networks by allowing the separation of the control and data plane. This has enabled the movement of complex functions from devices in the network to the dedicated controllers. Therefore, controller placement is a very important task in SDN, and better schemes need to be developed for realistic wireless channels. The performance analysis of the developed controller placement algorithms is mandatory to evaluate their impact in SDN towards achieving the required quality of service on lossy links. This work develops the Distributed Controller Placement (DCP) scheme and investigates its application as compared to the $K$-critical, $K$-median, $K$-centre and the traditional Greedy algorithms. Comparatively., the performance evaluation shows that DCP significantly reduces the number of required controllers and produces balanced trees.