IP-over-WDM网络中可生存路由的可扩展算法

F. Ducatelle, L. Gambardella
{"title":"IP-over-WDM网络中可生存路由的可扩展算法","authors":"F. Ducatelle, L. Gambardella","doi":"10.1109/BROADNETS.2004.11","DOIUrl":null,"url":null,"abstract":"In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm which can provide survivable routing in the presence of physical link failures. The algorithm can easily be extended for the case of node failures and multiple simultaneous link failures. In a large series of test runs, we show that FastSurv is much more scalable with respect to the number of nodes in the network than current state-of-the-art algorithms, both in terms of solution quality and run time.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"A scalable algorithm for survivable routing in IP-over-WDM networks\",\"authors\":\"F. Ducatelle, L. Gambardella\",\"doi\":\"10.1109/BROADNETS.2004.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm which can provide survivable routing in the presence of physical link failures. The algorithm can easily be extended for the case of node failures and multiple simultaneous link failures. In a large series of test runs, we show that FastSurv is much more scalable with respect to the number of nodes in the network than current state-of-the-art algorithms, both in terms of solution quality and run time.\",\"PeriodicalId\":305639,\"journal\":{\"name\":\"First International Conference on Broadband Networks\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Conference on Broadband Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BROADNETS.2004.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Broadband Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2004.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在IP-over- wdm网络中,逻辑IP网络必须路由在物理光纤网络之上。因此,一个重要的挑战是使路由可生存。如果在物理网络发生故障的情况下,逻辑网络的连通性得到保证,则我们称路由为可生存的。在本文中,我们描述了FastSurv,一个本地搜索算法,它可以在存在物理链路故障的情况下提供可生存路由。该算法可以很容易地扩展到节点故障和多个链路同时故障的情况。在大量的测试运行中,我们表明,无论是在解决方案质量还是运行时间方面,FastSurv在网络节点数量方面都比当前最先进的算法具有更高的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A scalable algorithm for survivable routing in IP-over-WDM networks
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm which can provide survivable routing in the presence of physical link failures. The algorithm can easily be extended for the case of node failures and multiple simultaneous link failures. In a large series of test runs, we show that FastSurv is much more scalable with respect to the number of nodes in the network than current state-of-the-art algorithms, both in terms of solution quality and run time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信