Multi-Constraint Contraction Hierarchies with Dynamic Label Restrictions for Routing in Optical Networks
We propose a multi-constraint routing algorithm with dynamic label restrictions based on the contraction hierarchies, considering spectrum, OSNR, and delay. Simulation shows the algorithm finds a path within 0.2ms at a relatively low memory cost.
Authors
- Yongli Zhao (ORCID: https://orcid.org/0000-0003-3716-8248)
- Jiaxing Guo (ORCID: https://orcid.org/0000-0002-7734-1319)
- Pan Yan (ORCID: https://orcid.org/0000-0002-8677-7528)
- Yingbo Fan (ORCID: https://orcid.org/0009-0009-9276-9549)
- Yajie Li (ORCID: https://orcid.org/0000-0002-8751-7947)
- Bingrong Zhou (ORCID: https://orcid.org/0000-0002-9940-0519)
- Jie Zhang (ORCID: https://orcid.org/0009-0004-5173-9996)
Institutions
- Beijing University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2024-11-02
- DOI
- https://doi.org/10.1109/acp/ipoc63121.2024.10809553
- Primary Topic
- Advanced Optical Network Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Natural Science Foundation of Beijing Municipality
- Fundamental Research Funds for the Central Universities