The controller placement problem (CPP) is one of the main issues that need to be addressed in the context of Software Defined Networking (SDN), especially when different aspects are being considered, such as latency, capacity, reliability, and load balancing. Most of the solutions in the literature address these aspects by considering a fixed load for each controller and attempting to equally distribute the traffic demand of the switches among the controllers, which also have a fixed common capacity. On the contrary, in this work, the CPP is studied by considering load, controller capacity, and the failure probability of controllers and links as varying over time. The CPP is formulated in terms of a robust optimization problem, which, by introducing the concept of scenario, takes into account changes in the network status due to failures, load variations, and changes in switches’ demand and controllers’ capacity. The provided solution is robust, that is, neither controllers’ re-placement nor switches’ re-assignment is required as network conditions change. Besides, a co-evolutionary algorithm is provided to solve the aforementioned optimization problem. Two populations coevolve based on the concept of complementary evolution of allied species in nature. Experimental results on a set of real-world network topologies and comparisons with the state-of-the-art have proven the superiority of the proposal, in terms of better latency, load balancing and resilience, in solving the CPP under different network status changes that might occur over time.
A co-evolutionary genetic algorithm for robust and balanced controller placement in software-defined networks
D'Angelo G.
;Palmieri F.
2023-01-01
Abstract
The controller placement problem (CPP) is one of the main issues that need to be addressed in the context of Software Defined Networking (SDN), especially when different aspects are being considered, such as latency, capacity, reliability, and load balancing. Most of the solutions in the literature address these aspects by considering a fixed load for each controller and attempting to equally distribute the traffic demand of the switches among the controllers, which also have a fixed common capacity. On the contrary, in this work, the CPP is studied by considering load, controller capacity, and the failure probability of controllers and links as varying over time. The CPP is formulated in terms of a robust optimization problem, which, by introducing the concept of scenario, takes into account changes in the network status due to failures, load variations, and changes in switches’ demand and controllers’ capacity. The provided solution is robust, that is, neither controllers’ re-placement nor switches’ re-assignment is required as network conditions change. Besides, a co-evolutionary algorithm is provided to solve the aforementioned optimization problem. Two populations coevolve based on the concept of complementary evolution of allied species in nature. Experimental results on a set of real-world network topologies and comparisons with the state-of-the-art have proven the superiority of the proposal, in terms of better latency, load balancing and resilience, in solving the CPP under different network status changes that might occur over time.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
