弹性光网络中共享备份路径保护的频谱利用率最小化

Chingfang Hsu, Hao Hu, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen
{"title":"弹性光网络中共享备份路径保护的频谱利用率最小化","authors":"Chingfang Hsu, Hao Hu, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen","doi":"10.1109/ICCNC.2019.8685656","DOIUrl":null,"url":null,"abstract":"Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks\",\"authors\":\"Chingfang Hsu, Hao Hu, Hsuan-Fang Fu, Jin-Jun Zheng, Shi-Xuan Chen\",\"doi\":\"10.1109/ICCNC.2019.8685656\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.\",\"PeriodicalId\":161815,\"journal\":{\"name\":\"2019 International Conference on Computing, Networking and Communications (ICNC)\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Computing, Networking and Communications (ICNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNC.2019.8685656\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2019.8685656","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在弹性光网络中,保护是一个重要的弹性问题。不仅对于工作光路,而且对于备份路径的路由、调制和频谱分配(RMSA)也是必不可少的。在保护方案中,通常讨论的是共享备份路径保护(SBPP)。SBPP允许备份光路共享频谱资源,从而减少分配的频率槽数。由于频谱资源有限,频谱使用严重影响阻塞性能。因此,我们的目标是尽量减少频谱的使用。对于RMSA,许多启发式算法追求最短路径或最小跳数路径,而忽略了所需频率槽数与调制电平最大传输距离之间的平衡。因此,我们提出了一种RMSA算法,即最低成本优先和最短路径算法(LCF)来推导工作光路和备份光路的RSA解。然而,在满足MTD约束的RSA解中,空闲资源消耗最少的可能既不是最小跳数路径,也不是最短路径。因此,我们提出了一种改进的RMSA算法,称为最小使用算法(minimum usage algorithm, MU),它可以预先计算出满足MTD约束的所有路径,然后找到资源使用最小的路径。仿真结果表明,LCF和MU都能显著提高阻塞性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spectrum Usage Minimization for Shared Backup Path Protection in Elastic Optical Networks
Protection is an important issue of resilience in elastic optical networks (EONs). Not only for working lightpaths, but also routing, modulation and spectrum assignment (RMSA) for backup paths is essential. In protection scheme, shared backup path protection (SBPP) is usually discussed now. SBPP allows backup lightpaths to share spectrum resource so that the amount of allocated frequency slots can be reduced. Spectrum usage critically affects blocking performance due to the limited resource in spectrum. For this reason, we aim at minimizing spectrum usage as our objective. For RMSA, many heuristic algorithms pursue the shortest path or minimum-hopped path and neglect the balance between number of required frequency slots and maximum transmission distance (MTD) of modulation levels. Therefore, we propose a RMSA algorithm, namely, lowest cost first and shortest path algorithm (LCF) to derive the RSA solutions for both working and backup lightpaths. However, among RSA solutions satisfying MTD constraint, the one with least vacant resource consumption might be neither the minimum-hopped path nor the shortest path. Hence we propose an enhanced RMSA algorithm called minimum usage algorithm (MU) to pre-calculate all paths satisfying MTD constraint and then find the one with minimum resource usage. Simulation results show that both LCF and MU can achieve great improvement on blocking performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信