分布式SDN控制器中的交换机迁移调度

Matthew Buckley, Sepehr Abbasi Zadeh, M. A. Beiruti, Soheil Abbasloo, Y. Ganjali
{"title":"分布式SDN控制器中的交换机迁移调度","authors":"Matthew Buckley, Sepehr Abbasi Zadeh, M. A. Beiruti, Soheil Abbasloo, Y. Ganjali","doi":"10.1109/NetSoft54395.2022.9844120","DOIUrl":null,"url":null,"abstract":"Due to the dynamic nature of traffic, networks must rapidly adapt to changing conditions. This is especially true in the context of the control plane which must ensure continuous and seamless operation. Switch migration, the process of changing the controller associated with a switch, is an important tool in facilitating this goal. In this work, we study the problem of minimizing the overall time to migrate a set of switches. We examine the problem subject to constraints on controller resources and QoS groups. We show that the problem is NP-hard and provide heuristic algorithms for solving large instances in practice. Through extensive experiments, we demonstrate that the heuristics achieve performance close to optimal while reducing the running time by several orders of magnitude.","PeriodicalId":125799,"journal":{"name":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Switch Migration Scheduling in Distributed SDN Controllers\",\"authors\":\"Matthew Buckley, Sepehr Abbasi Zadeh, M. A. Beiruti, Soheil Abbasloo, Y. Ganjali\",\"doi\":\"10.1109/NetSoft54395.2022.9844120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the dynamic nature of traffic, networks must rapidly adapt to changing conditions. This is especially true in the context of the control plane which must ensure continuous and seamless operation. Switch migration, the process of changing the controller associated with a switch, is an important tool in facilitating this goal. In this work, we study the problem of minimizing the overall time to migrate a set of switches. We examine the problem subject to constraints on controller resources and QoS groups. We show that the problem is NP-hard and provide heuristic algorithms for solving large instances in practice. Through extensive experiments, we demonstrate that the heuristics achieve performance close to optimal while reducing the running time by several orders of magnitude.\",\"PeriodicalId\":125799,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NetSoft54395.2022.9844120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 8th International Conference on Network Softwarization (NetSoft)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NetSoft54395.2022.9844120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

由于流量的动态性,网络必须快速适应不断变化的环境。在必须确保连续和无缝运行的控制平面中尤其如此。交换机迁移,即改变与交换机相关的控制器的过程,是实现这一目标的重要工具。在这项工作中,我们研究了迁移一组开关的总时间最小化问题。我们根据控制器资源和QoS组的约束来研究这个问题。我们证明了这个问题是np困难的,并提供了在实践中解决大型实例的启发式算法。通过大量的实验,我们证明了启发式算法的性能接近最优,同时将运行时间减少了几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Switch Migration Scheduling in Distributed SDN Controllers
Due to the dynamic nature of traffic, networks must rapidly adapt to changing conditions. This is especially true in the context of the control plane which must ensure continuous and seamless operation. Switch migration, the process of changing the controller associated with a switch, is an important tool in facilitating this goal. In this work, we study the problem of minimizing the overall time to migrate a set of switches. We examine the problem subject to constraints on controller resources and QoS groups. We show that the problem is NP-hard and provide heuristic algorithms for solving large instances in practice. Through extensive experiments, we demonstrate that the heuristics achieve performance close to optimal while reducing the running time by several orders of magnitude.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信