Fragmentation-aware spectrum assignment strategies for elastic optical networks with static operation

J. Cedeño, A. Lozada, R. Olivares, N. Jara
{"title":"Fragmentation-aware spectrum assignment strategies for elastic optical networks with static operation","authors":"J. Cedeño, A. Lozada, R. Olivares, N. Jara","doi":"10.1109/SCCC51225.2020.9281223","DOIUrl":null,"url":null,"abstract":"One of the main problems in the design of elastic optical networks is the Routing, Modulation-Level, and Spectrum Assignment problem (RMLSA). In this work, we propose new strategies to solve the spectrum assignment (SA) sub-problem for EONs architectures with static network operation. To this end, we developed two new approaches called Sliding-Fit (SF) and Parcel-Fit (PF), focused on minimizing the spectrum fragmentation obtained when attending network demands. These strategies change to standard paradigm use to search an amount of consecutive FSUs for a given user by choosing a subset of FSUs in the frequency spectrum and later finding users for the selected FSUs. Additionally, the method relies on a physical-later impairment (PLI) model to compute the maximum optical reach and bandwidth demands based on the modulation level - bitrate pair.Experimental results showed that the proposed algorithms obtain less spectrum fragmentation than the best found in the literature, allowing to assign a higher number of users, decreasing the network capacity or increasing the efficiency in the use of resources.","PeriodicalId":117157,"journal":{"name":"2020 39th International Conference of the Chilean Computer Science Society (SCCC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 39th International Conference of the Chilean Computer Science Society (SCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC51225.2020.9281223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

One of the main problems in the design of elastic optical networks is the Routing, Modulation-Level, and Spectrum Assignment problem (RMLSA). In this work, we propose new strategies to solve the spectrum assignment (SA) sub-problem for EONs architectures with static network operation. To this end, we developed two new approaches called Sliding-Fit (SF) and Parcel-Fit (PF), focused on minimizing the spectrum fragmentation obtained when attending network demands. These strategies change to standard paradigm use to search an amount of consecutive FSUs for a given user by choosing a subset of FSUs in the frequency spectrum and later finding users for the selected FSUs. Additionally, the method relies on a physical-later impairment (PLI) model to compute the maximum optical reach and bandwidth demands based on the modulation level - bitrate pair.Experimental results showed that the proposed algorithms obtain less spectrum fragmentation than the best found in the literature, allowing to assign a higher number of users, decreasing the network capacity or increasing the efficiency in the use of resources.
静态运行弹性光网络的碎片感知频谱分配策略
弹性光网络设计中的一个主要问题是路由、调制和频谱分配问题(RMLSA)。在这项工作中,我们提出了新的策略来解决具有静态网络运行的eon架构的频谱分配子问题。为此,我们开发了两种新方法,称为滑动-契合(SF)和包裹-契合(PF),重点是在满足网络需求时最大限度地减少频谱碎片。这些策略转变为标准范例,通过在频谱中选择fsu的子集,然后为选定的fsu找到用户,为给定用户搜索连续的fsu数量。此外,该方法依赖于物理后期损伤(PLI)模型来计算基于调制电平-比特率对的最大光到达和带宽需求。实验结果表明,本文提出的算法比文献中最好的算法获得更少的频谱碎片,允许分配更多的用户数量,减少网络容量或提高资源利用效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信