考虑故障恢复能力的软件定义网络中电容式控制器安置的元heuristic算法

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Sagarika Mohanty, Bibhudatta Sahoo
{"title":"考虑故障恢复能力的软件定义网络中电容式控制器安置的元heuristic算法","authors":"Sagarika Mohanty,&nbsp;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":"{\"title\":\"Metaheuristic algorithms for capacitated controller placement in software defined networks considering failure resilience\",\"authors\":\"Sagarika Mohanty,&nbsp;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}","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

摘要

摘要软件定义网络(SDN)通过将控制平面与数据平面分离,彻底改变了网络架构。在这一范例中,一个引人入胜的挑战是如何战略性地放置控制器和分配交换机,以优化网络性能和弹性。在控制器发生故障时,交换机将与控制器断开连接,直到它们被重新分配到拥有足够备用容量的其他活动控制器上。重新分配可能会导致传播延迟显著增加。本文介绍了一个用于容纳控制器位置的数学模型,其战略设计旨在预测故障并防止最坏情况下延迟和断开的大幅增加。其目的是最大限度地减少交换机及其备份控制器之间以及控制器之间的最坏情况延迟。本文提出了四种元启发式算法,包括增强型遗传算法(CCPCFR-EGA)、粒子群优化算法(CCPCFR-PSO)、粒子群优化和模拟退火混合算法(CCPCFR-HPSOSA)以及灰狼优化算法(CCPCFR-GWO)。这些算法与模拟退火方法和最优方法进行了比较。在四个网络数据集上进行的评估表明,所提出的元启发式方法比最优方法更快。实验结果表明,CCPCFR-HPSOSA 和 CCPCFR-GWO 优于其他方法,能持续提供接近最优的解决方案。然而,由于 CCPCFR-HPSOSA 的执行时间更快,CCPCFR-GWO 比 CCPCFR-HPSOSA 更受青睐。具体来说,对于较小的网络,CCPCFR-GWO 比最优方法平均加快了 3.9 倍,对于较大的网络,平均加快了 31.78 倍,但仍能提供接近最优的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Metaheuristic algorithms for capacitated controller placement in software defined networks considering failure resilience

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 & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信