Joint routing, band, and spectrum assignment in C+L band elastic optical networks towards ultra-broadband era

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Weichang Zheng , Mingcong Yang , Yu Zheng , Yongbing Zhang , Kun Yang
{"title":"Joint routing, band, and spectrum assignment in C+L band elastic optical networks towards ultra-broadband era","authors":"Weichang Zheng ,&nbsp;Mingcong Yang ,&nbsp;Yu Zheng ,&nbsp;Yongbing Zhang ,&nbsp;Kun Yang","doi":"10.1016/j.comnet.2025.111373","DOIUrl":null,"url":null,"abstract":"<div><div>The rapid growth in Internet traffic is pushing single-fiber capacity closer to its Shannon limit, highlighting the need for advancements in optical communication technologies. Elastic Optical Networks (EONs) have emerged as a promising solution to improve spectral efficiency. Another method to expand capacity is by using both C and L bands, instead of relying solely on the C band, thereby expanding the available spectrum. However, the introduction of new transmission technologies and the expansion of spectrum resources necessitate operators to re-plan networks in a cost-effective manner. In this paper, we propose a two-layer network architecture that separates the C-band and L-band. Given that the optical parameters of these bands differ, it becomes essential to allocate routing and resources dynamically based on varying traffic demands. We define this problem as the Routing, Band, and Spectrum Assignment (RBSA) problem and prove its NP-hardness. To address it, we introduce an Integer Linear Programming (ILP) model aimed at minimizing capital expenditure (CAPEX), along with a heuristic algorithm for large-scale instances. Simulation experiments using different sizes of service request matrices on two network topologies demonstrate the effectiveness of both the ILP model and the heuristic algorithm. To the best of our knowledge, this is the first work that addresses the RBSA problem in C+L band EONs.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"267 ","pages":"Article 111373"},"PeriodicalIF":4.6000,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625003408","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

The rapid growth in Internet traffic is pushing single-fiber capacity closer to its Shannon limit, highlighting the need for advancements in optical communication technologies. Elastic Optical Networks (EONs) have emerged as a promising solution to improve spectral efficiency. Another method to expand capacity is by using both C and L bands, instead of relying solely on the C band, thereby expanding the available spectrum. However, the introduction of new transmission technologies and the expansion of spectrum resources necessitate operators to re-plan networks in a cost-effective manner. In this paper, we propose a two-layer network architecture that separates the C-band and L-band. Given that the optical parameters of these bands differ, it becomes essential to allocate routing and resources dynamically based on varying traffic demands. We define this problem as the Routing, Band, and Spectrum Assignment (RBSA) problem and prove its NP-hardness. To address it, we introduce an Integer Linear Programming (ILP) model aimed at minimizing capital expenditure (CAPEX), along with a heuristic algorithm for large-scale instances. Simulation experiments using different sizes of service request matrices on two network topologies demonstrate the effectiveness of both the ILP model and the heuristic algorithm. To the best of our knowledge, this is the first work that addresses the RBSA problem in C+L band EONs.
面向超宽带时代的C+L波段弹性光网络的联合路由、频带和频谱分配
互联网流量的快速增长正在推动单光纤容量接近其香农极限,这突出了对光通信技术进步的需求。弹性光网络(EONs)已成为提高频谱效率的一种有前途的解决方案。另一种扩展容量的方法是同时使用C波段和L波段,而不是仅仅依靠C波段,从而扩大可用频谱。然而,随着新的传输技术的引入和频谱资源的扩展,运营商必须以经济有效的方式重新规划网络。本文提出了一种分离c波段和l波段的两层网络架构。由于这些频段的光参数不同,因此根据不同的业务需求动态分配路由和资源变得至关重要。我们将这个问题定义为路由、频带和频谱分配(RBSA)问题,并证明了它的np -硬度。为了解决这个问题,我们引入了一个旨在最小化资本支出(CAPEX)的整数线性规划(ILP)模型,以及用于大规模实例的启发式算法。在两种网络拓扑上使用不同大小的服务请求矩阵进行仿真实验,验证了启发式算法和ILP模型的有效性。据我们所知,这是第一个解决C+L波段eon中RBSA问题的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信