Selection of candidate paths based on diversity in resource allocation problems on optical networks

IF 3.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Yuta Mori, Maiko Shigeno
{"title":"Selection of candidate paths based on diversity in resource allocation problems on optical networks","authors":"Yuta Mori,&nbsp;Maiko Shigeno","doi":"10.1016/j.osn.2025.100826","DOIUrl":null,"url":null,"abstract":"<div><div>Optical networks play an essential role as an infrastructure supporting advanced information and communication technology. Elastic Optical Networks (EONs) have been designed to improve frequency resource utilization efficiency and enable flexible and efficient network operations. In EONs, the Routing and Spectrum Allocation (RSA) problem — which involves determining routes of transmission and allocating frequency resources — is a critical issue for efficient network operation. Traditionally, the k-Shortest Paths (kSP) approach has been widely used for candidate transmission routes. However, kSP often leads to the concentration of transmission on specific links, creating bottlenecks for resource allocation. To address this challenge, we propose three novel candidate path selection methods for the RSA problem: (1) ensuring path diversity through similarity constraints via 0–1 integer programming, (2) clustering based on path similarity, and (3) suppressing link sharing through node pair grouping. Numerical experiments performed to assure the effectiveness of our proposed methods, and confirmed that introducing path diversity can yield high-quality solutions to the RSA problem under specific scenarios.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"58 ","pages":"Article 100826"},"PeriodicalIF":3.1000,"publicationDate":"2025-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optical Switching and Networking","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1573427725000335","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Optical networks play an essential role as an infrastructure supporting advanced information and communication technology. Elastic Optical Networks (EONs) have been designed to improve frequency resource utilization efficiency and enable flexible and efficient network operations. In EONs, the Routing and Spectrum Allocation (RSA) problem — which involves determining routes of transmission and allocating frequency resources — is a critical issue for efficient network operation. Traditionally, the k-Shortest Paths (kSP) approach has been widely used for candidate transmission routes. However, kSP often leads to the concentration of transmission on specific links, creating bottlenecks for resource allocation. To address this challenge, we propose three novel candidate path selection methods for the RSA problem: (1) ensuring path diversity through similarity constraints via 0–1 integer programming, (2) clustering based on path similarity, and (3) suppressing link sharing through node pair grouping. Numerical experiments performed to assure the effectiveness of our proposed methods, and confirmed that introducing path diversity can yield high-quality solutions to the RSA problem under specific scenarios.
光网络资源分配问题中基于多样性的候选路径选择
光网络作为支撑先进信息通信技术的基础设施,发挥着重要作用。弹性光网络(Elastic Optical network, eon)是为了提高频率资源的利用效率,实现灵活高效的网络运行而设计的。在EONs中,路由和频谱分配(RSA)问题——包括确定传输路由和分配频率资源——是网络高效运行的关键问题。传统上,k-最短路径(kSP)方法被广泛用于候选传输路由。但是,kSP常常导致传输集中在特定的链路上,给资源分配造成瓶颈。为了解决这一挑战,我们提出了三种新的RSA问题候选路径选择方法:(1)通过0-1整数规划的相似性约束确保路径多样性,(2)基于路径相似性的聚类,以及(3)通过节点对分组抑制链路共享。通过数值实验验证了所提方法的有效性,并证实了在特定场景下引入路径多样性可以得到高质量的RSA问题解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Optical Switching and Networking
Optical Switching and Networking COMPUTER SCIENCE, INFORMATION SYSTEMS-OPTICS
CiteScore
5.20
自引率
18.20%
发文量
29
审稿时长
77 days
期刊介绍: Optical Switching and Networking (OSN) is an archival journal aiming to provide complete coverage of all topics of interest to those involved in the optical and high-speed opto-electronic networking areas. The editorial board is committed to providing detailed, constructive feedback to submitted papers, as well as a fast turn-around time. Optical Switching and Networking considers high-quality, original, and unpublished contributions addressing all aspects of optical and opto-electronic networks. Specific areas of interest include, but are not limited to: • Optical and Opto-Electronic Backbone, Metropolitan and Local Area Networks • Optical Data Center Networks • Elastic optical networks • Green Optical Networks • Software Defined Optical Networks • Novel Multi-layer Architectures and Protocols (Ethernet, Internet, Physical Layer) • Optical Networks for Interet of Things (IOT) • Home Networks, In-Vehicle Networks, and Other Short-Reach Networks • Optical Access Networks • Optical Data Center Interconnection Systems • Optical OFDM and coherent optical network systems • Free Space Optics (FSO) networks • Hybrid Fiber - Wireless Networks • Optical Satellite Networks • Visible Light Communication Networks • Optical Storage Networks • Optical Network Security • Optical Network Resiliance and Reliability • Control Plane Issues and Signaling Protocols • Optical Quality of Service (OQoS) and Impairment Monitoring • Optical Layer Anycast, Broadcast and Multicast • Optical Network Applications, Testbeds and Experimental Networks • Optical Network for Science and High Performance Computing Networks
×
引用
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学术官方微信