{"title":"Metaheuristic algorithms for capacitated controller placement in software defined networks considering failure resilience","authors":"Sagarika Mohanty, Bibhudatta Sahoo","doi":"10.1002/cpe.8254","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Software-defined networking (SDN) has revolutionized network architectures by decoupling the control plane from the data plane. An intriguing challenge within this paradigm is the strategic placement of controllers and the allocation of switches to optimize network performance and resilience. In the event of a controller failure, the switches are disconnected from the controller until they are reassigned to other active controllers possessing sufficient spare capacity. The reassignment could lead to a significant rise in propagation latency. This correspondence presents a mathematical model for capacitated controller placement, strategically designed to anticipate failures and prevent a substantial increase in worst-case latency and disconnections. The aim is to minimize the worst-case latency between switches and their backup controllers and among the controllers. Four metaheuristic algorithms are proposed including, an enhanced genetic algorithm (CCPCFR-EGA), particle swarm optimization (CCPCFR-PSO), a hybrid particle swarm optimization and simulated annealing algorithm (CCPCFR-HPSOSA), and a grey wolf optimization algorithm (CCPCFR-GWO). These algorithms are compared with a simulated annealing method and an optimal method. Evaluation conducted on four network datasets demonstrates that the proposed metaheuristic methods are faster than the optimal method. The experimental outcome indicates that CCPCFR-HPSOSA and CCPCFR-GWO outperform the other methods, consistently providing near-optimal solutions. However, CCPCFR-GWO is preferred over CCPCFR-HPSOSA due to its faster execution time. Specifically, CCPCFR-GWO achieves an average speed-up of 3.9 over the optimal for smaller networks and an average speed-up of 31.78 for larger networks, while still producing near-optimal solutions.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 24","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8254","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Software-defined networking (SDN) has revolutionized network architectures by decoupling the control plane from the data plane. An intriguing challenge within this paradigm is the strategic placement of controllers and the allocation of switches to optimize network performance and resilience. In the event of a controller failure, the switches are disconnected from the controller until they are reassigned to other active controllers possessing sufficient spare capacity. The reassignment could lead to a significant rise in propagation latency. This correspondence presents a mathematical model for capacitated controller placement, strategically designed to anticipate failures and prevent a substantial increase in worst-case latency and disconnections. The aim is to minimize the worst-case latency between switches and their backup controllers and among the controllers. Four metaheuristic algorithms are proposed including, an enhanced genetic algorithm (CCPCFR-EGA), particle swarm optimization (CCPCFR-PSO), a hybrid particle swarm optimization and simulated annealing algorithm (CCPCFR-HPSOSA), and a grey wolf optimization algorithm (CCPCFR-GWO). These algorithms are compared with a simulated annealing method and an optimal method. Evaluation conducted on four network datasets demonstrates that the proposed metaheuristic methods are faster than the optimal method. The experimental outcome indicates that CCPCFR-HPSOSA and CCPCFR-GWO outperform the other methods, consistently providing near-optimal solutions. However, CCPCFR-GWO is preferred over CCPCFR-HPSOSA due to its faster execution time. Specifically, CCPCFR-GWO achieves an average speed-up of 3.9 over the optimal for smaller networks and an average speed-up of 31.78 for larger networks, while still producing near-optimal solutions.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.