Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings

F. Poppe, H. de Neve, G. Petit
{"title":"Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings","authors":"F. Poppe, H. de Neve, G. Petit","doi":"10.1109/HPSR.2001.923622","DOIUrl":null,"url":null,"abstract":"We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features of the network architecture complicate the routing problem. The algorithm we present in this paper meets the requirement of being fast. Moreover, the routing of a lightpath is based on a limited amount of link state information, which can be disseminated by a lightweight routing protocol. Our numerical results show that the performance of the algorithm does not improve significantly if the routing decisions are based on more detailed information about the configuration of the network.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features of the network architecture complicate the routing problem. The algorithm we present in this paper meets the requirement of being fast. Moreover, the routing of a lightpath is based on a limited amount of link state information, which can be disseminated by a lightweight routing protocol. Our numerical results show that the performance of the algorithm does not improve significantly if the routing decisions are based on more detailed information about the configuration of the network.
逻辑覆盖OCh/SP环的lambda交换网状光网络约束最短路径优先算法
针对具有逻辑覆盖OCh/SP环的lambda交换光网络,提出了一种约束最短路径优先(CSPF)路由算法。如果要将算法用于lambda交换,速度肯定是一个要求,但是网络体系结构的几个特性使路由问题复杂化。本文提出的算法满足了快速的要求。此外,光路的路由基于有限数量的链路状态信息,这些信息可以通过轻量级路由协议传播。我们的数值结果表明,如果路由决策基于更详细的网络配置信息,则算法的性能不会得到显着提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信