弹性光网络中的路由和频谱分配问题
A Study of the Routing and Spectrum Allocation in Elastic Optical Networks
DOI: 10.12677/orf.2026.161002, PDF,    国家自然科学基金支持
作者: 刘婷婷, 帅天平*:北京邮电大学数学科学学院,北京;北京邮电大学数学与信息网络教育部重点实验室,北京
关键词: 弹性光网络路由和频谱分配问题线性整数规划模型分支切割算法Elastic Optical Networks Routing and Spectrum Allocation Integer Linear Programming Branch-and-Cut Algorithm
摘要: 随着网络流量需求激增,弹性光网络因其高效的频谱利用率成为热点,路由和频谱分配问题是其核心研究问题。目前,整数线性规划模型是求解路由和频谱分配问题的重要方法,但现有的研究多集中于一般网络拓扑,直接应用于特殊拓扑如环网络会导致模型复杂、求解效率低下。本文旨在针对环网络这一常见拓扑结构,根据环网络的自身特性,建立线性整数规划模型以精确求解路由和频谱分配问题。在此基础上,设计了一种结合问题具体情况的分支切割算法,包括初始化上下界、设计分支策略以及寻找有效割平面等方法。数值实验表明,我们所建模型在问题求解规模和求解时间上均表现出显著优势,进一步应用分支切割算法后,求解规模得到进一步扩展。本文提出的简化线性整数规模模型在精确求解路由和频谱分配问题上具有优越性,所设计的分支切割算法能有效提升大规模问题的求解效率与求解规模,为环形网络中的频谱资源优化提供了有效的理论工具与算法支持。
Abstract: With the explosive growth of network traffic demand, elastic optical networks have emerged as a hot research topic due to their high spectrum efficiency. The routing and spectrum allocation problem stands as a core research challenge in this domain. Currently, the integer linear programming model serves as an important method for solving the routing and spectrum allocation problem. However, existing studies mostly focus on general network topologies, and applying these models directly to special topologies such as ring networks often leads to high model complexity and low solving efficiency. This paper aims to address the routing and spectrum allocation problem for the common ring network topology by establishing a linear integer programming model that precisely solves the problem based on the inherent characteristics of ring networks. Furthermore, a branch-and-cut algorithm tailored to the specific problem is designed, incorporating methods such as initializing upper and lower bounds, designing branching strategies, and identifying effective cutting planes. Numerical experiments show that the proposed model exhibits significant advantages in terms of problem-solving scale and computation time. After further applying the branch-and-cut algorithm, the solving scale is further extended. The simplified linear integer programming model presented in this paper demonstrates superiority in precisely solving the routing and spectrum allocation problem, and the designed branch-and-cut algorithm effectively enhances the solving efficiency and scale for large-scale problems, providing a valuable theoretical tool and algorithmic support for spectrum resource optimization in ring networks.
文章引用:刘婷婷, 帅天平. 弹性光网络中的路由和频谱分配问题[J]. 运筹与模糊学, 2026, 16(1): 10-22. https://doi.org/10.12677/orf.2026.161002

参考文献

[1] Lee, T., Lee, K. and Sungsoo Park, (2000) Optimal Routing and Wavelength Assignment in WDM Ring Networks. IEEE Journal on Selected Areas in Communications, 18, 2146-2154. [Google Scholar] [CrossRef
[2] Wang, Y., Cao, X. and Pan, Y. (2011) A Study of the Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks. 2011 Proceedings IEEE INFOCOM, Shanghai, 10-15 April 2011, 1503-1511. [Google Scholar] [CrossRef
[3] 张雷. 路由和频谱分配问题的近似算法研究[D]: [硕士学位论文]. 杭州: 杭州电子科技大学, 2019.
[4] Wang, J., Shigeno, M. and Wu, Q. (2022) ILP Models and Improved Methods for the Problem of Routing and Spectrum Allocation. Optical Switching and Networking, 44, Article ID: 100675. [Google Scholar] [CrossRef
[5] David, F., Rezende, J.F.D. and Barbosa, V.C. (2024) Exact Solution of the Full RMSA Problem in Elastic Optical Networks. IEEE Networking Letters, 6, 55-59. [Google Scholar] [CrossRef
[6] Cavendish, D. and Sengupta, B. (2002) Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities. Proceedings of IEEE INFOCOM 2002, New York, 23-27 June 2002, 1415-1424.
[7] Lardies, A., Jagannathan, R., Fumagalli, A., Cerutti, I. and Tacca, M. (2001) A Flexible WDM Ring Network Design and Dimensioning Methodology. In: Stavdas, A.A., Ed., New Trends in Optical Network Design and Modeling. ONDM 2000, Springer, 123-138. [Google Scholar] [CrossRef
[8] Walkowiak, K., Kucharzak, M., Kopec, P. and Kasprzak, A. (2014) ILP Model and Algorithms for Restoration of Anycast Flows in Elastic Optical Networks. 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), Barcelona, 17-19 November 2014, 102-108. [Google Scholar] [CrossRef
[9] Velasco, L., Castro, A., Ruiz, M. and Junyent, G. (2014) Solving Routing and Spectrum Allocation Related Optimization Problems: From Off-Line to In-Operation Flexgrid Network Planning. Journal of Lightwave Technology, 32, 2780-2795. [Google Scholar] [CrossRef
[10] Capucho, J.H.L. and Resendo, L.C. (2013) ILP Model and Effective Genetic Algorithm for Routing and Spectrum Allocation in Elastic Optical Networks. 2013 SBMO/IEEE MTT-S International Microwave & Optoelectronics Conference (IMOC), Rio de Janeiro, 4-7 August 2013, 1-5. [Google Scholar] [CrossRef
[11] Jinno, M., Kozicki, B., Takara, H., Watanabe, A., Sone, Y., Tanaka, T., et al. (2010) Distance-Adaptive Spectrum Resource Allocation in Spectrum-Sliced Elastic Optical Path Network [Topics in Optical Communications. IEEE Communications Magazine, 48, 138-145. [Google Scholar] [CrossRef
[12] Velasco, L., Klinkowski, M., Ruiz, M. and Comellas, J. (2012) Modeling the Routing and Spectrum Allocation Problem for Flexgrid Optical Networks. Photonic Network Communications, 24, 177-186. [Google Scholar] [CrossRef
[13] Zhang, J., Miao, P. and Zhang, F. (2023) On Optimal Routing and Spectrum Allocation in Elastic Optical Networks. 2023 2nd International Conference on Big Data, Information and Computer Network (BDICN), Xishuangbanna, 6-8 January 2023, 284-287. [Google Scholar] [CrossRef
[14] Bianchetti, M. and Marenco, J. (2021) Valid Inequalities and a Branch-And-Cut Algorithm for the Routing and Spectrum Allocation Problem. Procedia Computer Science, 195, 523-531. [Google Scholar] [CrossRef
[15] Klinkowski, M., Pioro, M., Zotkiewicz, M., et al. (2015) Spectrum Allocation Problem in Elastic Optical Networks—A Branch-And-Price Approach. 2015 17th International Conference on Transparent Optical Networks (ICTON), Budapest, 5-9July 2015, 1-5. [Google Scholar] [CrossRef
[16] Bertero, F., Bianchetti, M. and Marenco, J. (2018) Integer Programming Models for the Routing and Spectrum Allocation Problem. TOP, 26, 465-488. [Google Scholar] [CrossRef
[17] Talebi, S., Katib, I. and Rouskas, G.N. (2016) Distance‐Adaptive Routing and Spectrum Assignment in Rings. IET Networks, 5, 64-70. [Google Scholar] [CrossRef
[18] Bianchetti, M.L. (2023) A Branch and Cut Algorithm for the Routing and Spectrum Allocation Problem. Discrete Applied Mathematics, 339, 107-126. [Google Scholar] [CrossRef