Multiconstraint Routing and Relay Scheduling Algorithms for Optical Networks
The challenge of optimal optical signal transmission in optical fiber networks is crucial for enhancing the network’s reliability, performance, and service quality. Traditional pathfinding methods, such as Dijkstra’s algorithm, focus on finding the shortest path but fail to account for critical factors like optical signal loss and wavelength continuity. This paper proposes a novel algorithm that integrates traditional pathfinding methods with multi-constraint checks to effectively overcome these challenges. Inspired by the similarity between multi-constrained pathfinding in optical networks and vehicle charging path planning model, our approach aims to identify the optimal path in large-scale optical networks quickly. The simulation results demonstrate that our approach successfully addresses the complex requirements of optical signal routing and relay under multiple constraints, achieving promising outcomes.
Authors
- Zihui Tang
- Jianjun Yang (ORCID: https://orcid.org/0000-0001-8040-8636)
- Longjiang Li (ORCID: https://orcid.org/0000-0003-1446-0692)
- Yang Jiao (ORCID: https://orcid.org/0000-0001-5971-9907)
- Rong Jia
Institutions
- University of Electronic Science and Technology of China (CN)
Publication Details
- Published
- 2024-10-24
- DOI
- https://doi.org/10.1109/asiancomnet63184.2024.10811040
- Primary Topic
- Advanced Optical Network Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Research and Development