Reoptimizing Network Slice Embedding on EON-enabled Transport Networks

Sepehr Taeb, Nashid Shahriar, Samir Chowdhury, M. Tornatore, R. Boutaba, J. Mitra, Mahdi Hemmati
{"title":"Reoptimizing Network Slice Embedding on EON-enabled Transport Networks","authors":"Sepehr Taeb, Nashid Shahriar, Samir Chowdhury, M. Tornatore, R. Boutaba, J. Mitra, Mahdi Hemmati","doi":"10.23919/CNSM52442.2021.9615515","DOIUrl":null,"url":null,"abstract":"5G transport networks will support dynamic services with diverse requirements through network slicing. Elastic Optical Networks (EONs) facilitate transport network slicing by flexible spectrum allocation and tuning of transmission configurations such as modulation format and forward error correction. A major challenge in supporting dynamic services is the lack of a priori knowledge of future slice requests. In consequence, slice embedding can become sub-optimal over time, leading to spectrum fragmentation and skewed utilization. This in turn can block future slice requests, impacting operator revenue. Therefore, operators need to periodically re-optimize slice embedding for reducing fragmentation. In this paper, we address this problem of re-optimizing network slice embedding on EONs for minimizing fragmentation. The problem is solved in its splittable version, which significantly increases problem complexity, but offers more opportunities for a larger set of re-configuration actions. We employ simulated annealing for systematically exploring the large solution space. We also propose a greedy algorithm to address the practical constraint to limit the number of re-configuration steps taken to reach a defragmentated state. Our extensive simulations demonstrate that the greedy algorithm yields a solution very close to that obtained using simulated annealing while requiring orders of magnitude lesser number of re-configuration actions.","PeriodicalId":358223,"journal":{"name":"2021 17th International Conference on Network and Service Management (CNSM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 17th International Conference on Network and Service Management (CNSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/CNSM52442.2021.9615515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

5G transport networks will support dynamic services with diverse requirements through network slicing. Elastic Optical Networks (EONs) facilitate transport network slicing by flexible spectrum allocation and tuning of transmission configurations such as modulation format and forward error correction. A major challenge in supporting dynamic services is the lack of a priori knowledge of future slice requests. In consequence, slice embedding can become sub-optimal over time, leading to spectrum fragmentation and skewed utilization. This in turn can block future slice requests, impacting operator revenue. Therefore, operators need to periodically re-optimize slice embedding for reducing fragmentation. In this paper, we address this problem of re-optimizing network slice embedding on EONs for minimizing fragmentation. The problem is solved in its splittable version, which significantly increases problem complexity, but offers more opportunities for a larger set of re-configuration actions. We employ simulated annealing for systematically exploring the large solution space. We also propose a greedy algorithm to address the practical constraint to limit the number of re-configuration steps taken to reach a defragmentated state. Our extensive simulations demonstrate that the greedy algorithm yields a solution very close to that obtained using simulated annealing while requiring orders of magnitude lesser number of re-configuration actions.
在eon传输网络上重新优化网络切片嵌入
5G传输网络将通过网络切片支持多样化需求的动态业务。弹性光网络(EONs)通过灵活的频谱分配和调制格式、前向纠错等传输配置的调整,促进了传输网络的切片。支持动态服务的一个主要挑战是缺乏对未来切片请求的先验知识。因此,随着时间的推移,切片嵌入可能会变得次优,导致频谱碎片化和扭曲的利用率。这反过来又会阻止未来的切片请求,影响运营商的收入。因此,运营商需要定期重新优化切片嵌入,以减少碎片。在本文中,我们解决了在eon上重新优化网络切片嵌入以最小化碎片的问题。问题以其可分割的版本解决,这大大增加了问题的复杂性,但为更大的重新配置操作集提供了更多机会。我们采用模拟退火来系统地探索大解空间。我们还提出了一种贪婪算法来解决实际约束,以限制达到碎片整理状态所采取的重新配置步骤的数量。我们的大量模拟表明,贪婪算法产生的解决方案非常接近使用模拟退火获得的解决方案,而需要的重新配置动作的数量要少几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信