controller placement

Software-defined networking (SDN) is a network structure where the control and data planes are separated. In traditional SDN, a single controller was in charge of control management, but this architecture had several constraints. To address these constraints, it is advisable to incorporate multiple controllers in the network. Selecting the number of controllers and connecting switches to them is known as the controller placement problem (CPP). CPP is a key hurdle in enhancing SDNs. In this paper a meta-heuristic algorithm called Honey Badger Algorithm (HBA), is used to determine the optimal alignment between switches and controllers. HBA is modified using genetic operators (GHBA). The assessments are conducted with a diverse range of controllers on four prominent software-defined networks sourced from the Internet Topology Zoo and are compared to numerous algorithms in this field. It is noted that GHBA outperforms other competing algorithms in terms of end-to-end delay and energy consumption.

Software-defined networking is a new network model proposed to solve the complexity of traditional network problems and facilitate dynamic network operation and management. The separation of the control plane from the data plane is the main idea of software-defined networks. Controllers are the operating system of software-defined networks and are responsible for managing the entire network. It is essential to locate controllers appropriately to have a balanced topology while guaranteeing low latency. In this work, a metaheuristic algorithm is used for controller placement. First, the problem is formulated, and the network is partitioned by a clustering algorithm. Then, the seagull optimization algorithm is used to determine a suitable place for the controller in each network partition dynamically. Simulations are performed on the standard network topology from the internet topology zoo dataset to evaluate the proposed method. Simulation results reveal that the proposed method performs well in case of delay and load balancing compared with the state-of-the-art optimization algorithms.

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controllers satisfying a set of routing and capacity constraints. In this paper, we suggest an effective solution method based on the so-called Iterated Local Search (ILS) strategy. We then, compare our method to an existing standard mathematical programming solver on an extensive set of problem instances. It turns out that our suggested method is computationally much more effective and efficient over middle to large instances of the problem.