Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
