多拓扑路由与虚拟拓扑和段路由

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Nicolas Huin, Sébastien Martin, Jérémie Leguay
{"title":"多拓扑路由与虚拟拓扑和段路由","authors":"Nicolas Huin,&nbsp;Sébastien Martin,&nbsp;Jérémie Leguay","doi":"10.1002/nem.2321","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations, we propose virtual MTR (vMTR), an MTR extension where demands are routed over virtual topologies that are silent; that is, they do not exchange LSA messages and that are continuously derived from a very limited set of real topologies, optimizing each QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps to reduce drastically the number of real topologies and that it is more robust to QoS changes. In the case where SR can actually be rolled-out, we also show that vMTR allows to drastically reduce SR overhead.</p>\n </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multitopology Routing With Virtual Topologies and Segment Routing\",\"authors\":\"Nicolas Huin,&nbsp;Sébastien Martin,&nbsp;Jérémie Leguay\",\"doi\":\"10.1002/nem.2321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations, we propose virtual MTR (vMTR), an MTR extension where demands are routed over virtual topologies that are silent; that is, they do not exchange LSA messages and that are continuously derived from a very limited set of real topologies, optimizing each QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps to reduce drastically the number of real topologies and that it is more robust to QoS changes. In the case where SR can actually be rolled-out, we also show that vMTR allows to drastically reduce SR overhead.</p>\\n </div>\",\"PeriodicalId\":14154,\"journal\":{\"name\":\"International Journal of Network Management\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2025-01-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Network Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/nem.2321\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Network Management","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nem.2321","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在网络设备无法升级的情况下,多拓扑路由(MTR)为流量工程提供了一种替代网段路由(SR)的方法。然而,由于拓扑交换链路状态消息方面的高开销以及需要频繁更新链路权重以跟上不断变化的网络条件,MTR通常仅限于少数拓扑和满足松散的QoS约束。为了克服这些限制,我们提出了虚拟MTR (vMTR),这是一种MTR扩展,其中需求通过沉默的虚拟拓扑路由;也就是说,它们不交换LSA消息,并且从非常有限的一组真实拓扑中连续导出LSA消息,从而优化每个QoS参数。在这种情况下,我们提出了一个多项式和精确的vMTR算法,并作为基准,提出了一个局部搜索算法的MTR。我们表明vMTR有助于大幅减少真实拓扑的数量,并且对QoS变化更具鲁棒性。在SR可以实际推出的情况下,我们还展示了vMTR允许大幅减少SR开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multitopology Routing With Virtual Topologies and Segment Routing

Multitopology routing (MTR) provides an attractive alternative to segment routing (SR) for traffic engineering when network devices cannot be upgraded. However, due to a high overhead in terms of link state messages exchanged by topologies and the need to frequently update link weights to follow evolving network conditions, MTR is often limited to a small number of topologies and the satisfaction of loose QoS constraints. To overcome these limitations, we propose virtual MTR (vMTR), an MTR extension where demands are routed over virtual topologies that are silent; that is, they do not exchange LSA messages and that are continuously derived from a very limited set of real topologies, optimizing each QoS parameter. In this context, we present a polynomial and exact algorithm for vMTR and, as a benchmark, a local search algorithm for MTR. We show that vMTR helps to reduce drastically the number of real topologies and that it is more robust to QoS changes. In the case where SR can actually be rolled-out, we also show that vMTR allows to drastically reduce SR overhead.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Network Management
International Journal of Network Management COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
5.10
自引率
6.70%
发文量
25
审稿时长
>12 weeks
期刊介绍: Modern computer networks and communication systems are increasing in size, scope, and heterogeneity. The promise of a single end-to-end technology has not been realized and likely never will occur. The decreasing cost of bandwidth is increasing the possible applications of computer networks and communication systems to entirely new domains. Problems in integrating heterogeneous wired and wireless technologies, ensuring security and quality of service, and reliably operating large-scale systems including the inclusion of cloud computing have all emerged as important topics. The one constant is the need for network management. Challenges in network management have never been greater than they are today. The International Journal of Network Management is the forum for researchers, developers, and practitioners in network management to present their work to an international audience. The journal is dedicated to the dissemination of information, which will enable improved management, operation, and maintenance of computer networks and communication systems. The journal is peer reviewed and publishes original papers (both theoretical and experimental) by leading researchers, practitioners, and consultants from universities, research laboratories, and companies around the world. Issues with thematic or guest-edited special topics typically occur several times per year. Topic areas for the journal are largely defined by the taxonomy for network and service management developed by IFIP WG6.6, together with IEEE-CNOM, the IRTF-NMRG and the Emanics Network of Excellence.
×
引用
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学术官方微信