Abstract
As a new network control and management method for network, software-defined networking (SDN) algorithms have attracted more attention to make networks agile and flexible. To meet the requirements of users and conquer the physical limitation of network, it is necessary to design an efficient controller placement mechanism of SDN, which is defined as an optimization problem to determine the proper positions and number of its controllers. As a modern optimization tool, Quantum-behavior particle swarm optimization (QPSO) algorithm demonstrates power fast convergence rate but limits in global search ability. In this paper, by introducing a full search history and excellent dimension update strategy into the traditional QPSO algorithm which enhances its performance, simulation results show that the proposed algorithm achieves better performance in dozens of different multi-controller placement problems.
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.
