A new quantum particle swarm optimization algorithm for controller placement problem in software-defined networking

Zhang Quan-yuan

doi:10.1016/j.compeleceng.2021.107456

A new quantum particle swarm optimization algorithm for controller placement problem in software-defined networking

2021-10-01

18

PRE

AI

DOI：10.1016/j.compeleceng.2021.107456

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Software-defined networking

Controller placement problem

Quantum particle swarm algorithm

Convergence rate

A new quantum particle swarm optimization algorithm for controller placement problem in software-defined networking

Abstract

Journal

Organization