Least-loaded-based routing with physical constraints in transparent optical networks

L. C. Vieira, Juliana de Santi, Douglas do Amaral, Lucas Darian Schwendler Vieira, K. Fonseca
{"title":"Least-loaded-based routing with physical constraints in transparent optical networks","authors":"L. C. Vieira, Juliana de Santi, Douglas do Amaral, Lucas Darian Schwendler Vieira, K. Fonseca","doi":"10.1109/LATINCOM.2017.8240176","DOIUrl":null,"url":null,"abstract":"All-optical (transparent) wavelength-division multiplexing (WDM), a cost-effective and low power consumption solution for core transport networks, suffers from physical-layer impairments that accumulate along optical paths. In this context, it is important to find dynamic routing schemes with good performance that can consider the optical-layer constraints. In this paper, we propose the alternative least loaded under physical impairments (ALLPI) and the ALLPI with threshold (ALLPI-TH) algorithms. These are heuristic routing methods by which the lightpath requests that cannot be provisioned based on the shortest physical distance are established over least-loaded routes, provided that the selected lightpaths satisfy the impairment constraints (OSNR and PMD). Either dispersion-limited or noise-limited network scenarios were studied, for the bit rate of 40 Gbps. The results indicate that the ALLPI-type algorithms produce significantly lower blocking probabilities when compared to the reference algorithms, especially for a highly-connected network and at higher loads.","PeriodicalId":190644,"journal":{"name":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 9th Latin-American Conference on Communications (LATINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LATINCOM.2017.8240176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

All-optical (transparent) wavelength-division multiplexing (WDM), a cost-effective and low power consumption solution for core transport networks, suffers from physical-layer impairments that accumulate along optical paths. In this context, it is important to find dynamic routing schemes with good performance that can consider the optical-layer constraints. In this paper, we propose the alternative least loaded under physical impairments (ALLPI) and the ALLPI with threshold (ALLPI-TH) algorithms. These are heuristic routing methods by which the lightpath requests that cannot be provisioned based on the shortest physical distance are established over least-loaded routes, provided that the selected lightpaths satisfy the impairment constraints (OSNR and PMD). Either dispersion-limited or noise-limited network scenarios were studied, for the bit rate of 40 Gbps. The results indicate that the ALLPI-type algorithms produce significantly lower blocking probabilities when compared to the reference algorithms, especially for a highly-connected network and at higher loads.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
透明光网络中具有物理约束的基于最小负载的路由
全光(透明)波分复用(WDM)是一种经济高效、低功耗的核心传输网络解决方案,但它存在沿光路累积的物理层损伤。在这种情况下,寻找能够考虑光层约束的性能良好的动态路由方案是很重要的。在本文中,我们提出了可选的最小负载物理损伤算法(ALLPI)和带阈值的ALLPI算法(ALLPI- th)。这些是启发式路由方法,通过这些方法,在所选择的光路满足损害约束(OSNR和PMD)的情况下,在最小负载路由上建立不能基于最短物理距离提供的光路请求。在比特率为40 Gbps的情况下,研究了色散限制或噪声限制的网络场景。结果表明,与参考算法相比,allpi类型算法产生的阻塞概率显着降低,特别是对于高连接网络和高负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Frame retransmission using a modified VST-TDMA access protocol in Picocell/WPAN Expected time to rendezvous in multi-hop cognitive radio networks Throughput and delay evaluation framework integrating SDN and IEEE 802.11s WMN Correlation sketching for ordered data Class of service in fog computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1