Using spanners to improve network performance

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-01 DOI:10.1016/j.comnet.2024.110976
Guy Rozenberg, Michael Segal
{"title":"Using spanners to improve network performance","authors":"Guy Rozenberg,&nbsp;Michael Segal","doi":"10.1016/j.comnet.2024.110976","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper we introduce a new, minimum-cuts based spanner algorithm, when the goal is twofold: (a) to decrease the number of active links in the network and (b) to maintain the ability of the SDN (Software-Defined Networking) controller to perform load balancing. The proposed spanner concept also can be used in order to reduce the running time of the SDN centralized routing algorithm. In addition, we show how to maintain the spanner under dynamic link insertion, deletion and changed weight. The validation of our solution is made through the analysis and simulation that show the superiority of our approach in many cases.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 110976"},"PeriodicalIF":4.6000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624008089","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper we introduce a new, minimum-cuts based spanner algorithm, when the goal is twofold: (a) to decrease the number of active links in the network and (b) to maintain the ability of the SDN (Software-Defined Networking) controller to perform load balancing. The proposed spanner concept also can be used in order to reduce the running time of the SDN centralized routing algorithm. In addition, we show how to maintain the spanner under dynamic link insertion, deletion and changed weight. The validation of our solution is made through the analysis and simulation that show the superiority of our approach in many cases.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用扳手提高网络性能
在本文中,我们介绍了一种新的,基于最小切割的扳手算法,当目标是双重的:(a)减少网络中活动链路的数量,(b)保持SDN(软件定义网络)控制器执行负载平衡的能力。提出的扳手概念也可以用于减少SDN集中路由算法的运行时间。此外,我们还展示了在动态连杆插入、删除和权重变化的情况下如何维护扳手。通过分析和仿真验证了我们的解决方案,在许多情况下显示了我们方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Design and evaluation of a robust and explainable intrusion detection framework for 5G/B5G networks OnlineADS: An online active learning approach to intrusion detection for WSNs Dynamic reliable SFC orchestration for SDN-NFV enabled networks Efficient level-3 secure certificateless signature against malicious KGC attacks for IoT An improved dynamic anonymous authentication and key agreement scheme for resource constrained IoT devices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1