A new dynamic path computation algorithm for multi-domain optical networks

D. Benhaddou, S. Dandu, N. Ghani, J. Subhlok
{"title":"A new dynamic path computation algorithm for multi-domain optical networks","authors":"D. Benhaddou, S. Dandu, N. Ghani, J. Subhlok","doi":"10.1109/ICTONMW.2008.4773100","DOIUrl":null,"url":null,"abstract":"Several emerging applications such as storage area networks, multimedia, video, and digital services demand high bandwidth. Although optical networks are deployed to provide high bandwidth at reduced costs, they are not flexible and not efficiently utilized. Such applications require end-to-end delivery of information and flexible bandwidth allocation; therefore provisioning in optical networks need to be dynamic, flexible and consider provisioning in multiple domains. This paper presents a novel dynamic path computation algorithm for optical multi-domain networks. This algorithm updates the inter-domain paths and domainpsilas egress node dynamically after visiting an intermediate domain between the source and the destination. Simulation results show that the performance of the proposed algorithm is better than existing source routing algorithm for provisioning circuits in optical multi-domain networks.","PeriodicalId":298995,"journal":{"name":"2008 2nd ICTON Mediterranean Winter","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 2nd ICTON Mediterranean Winter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTONMW.2008.4773100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Several emerging applications such as storage area networks, multimedia, video, and digital services demand high bandwidth. Although optical networks are deployed to provide high bandwidth at reduced costs, they are not flexible and not efficiently utilized. Such applications require end-to-end delivery of information and flexible bandwidth allocation; therefore provisioning in optical networks need to be dynamic, flexible and consider provisioning in multiple domains. This paper presents a novel dynamic path computation algorithm for optical multi-domain networks. This algorithm updates the inter-domain paths and domainpsilas egress node dynamically after visiting an intermediate domain between the source and the destination. Simulation results show that the performance of the proposed algorithm is better than existing source routing algorithm for provisioning circuits in optical multi-domain networks.
一种新的多域光网络动态路径计算算法
一些新兴的应用,如存储区域网络、多媒体、视频和数字业务,都需要高带宽。虽然部署光网络是为了以较低的成本提供高带宽,但其灵活性和利用率不高。这类应用需要端到端的信息传递和灵活的带宽分配;因此,光网络的业务发放需要动态、灵活,并考虑多域的业务发放。提出了一种新的光多域网络动态路径计算算法。该算法在访问源和目的之间的中间域后,动态更新域间路径和域塞拉斯出口节点。仿真结果表明,在光多域网络中,该算法的性能优于现有的源路由算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信