You can view the full text of this article for free using the link below.

Title: Optimal routing strategy for multi-constraint scenarios in software-defined optical transport networks

Authors: Peng Zhu; Hong Sun; Qian Xiang; Zhenming Zhang

Addresses: School of Information Science and Engineering, Wuchang Shouyi University, Wuhan, Hubei, China ' School of Information Science and Engineering, Wuchang Shouyi University, Wuhan, Hubei, China ' School of Information Science and Engineering, Wuchang Shouyi University, Wuhan, Hubei, China ' School of Information Science and Engineering, Wuchang Shouyi University, Wuhan, Hubei, China

Abstract: To address the challenge of computing the optimal loop-free path under multiple complex logical constraints in a software-defined optical transport network with hybrid optical-electrical layer scenarios, this paper proposes an optimal path calculation method for complex logic combination constraints. First, a unified constraint expression is employed to describe the constraints, simplifying and decomposing the logical relationships. The network topology is then transformed accordingly, mapping various complex constraints onto the original structure. Next, an improved K-shortest path algorithm is applied to obtain, in a single computation, the path that satisfies multiple complex constraints, including 'AND', 'OR' and bidirectional link requirements, while ensuring the global optimal solution. Experimental results demonstrate that this method offers higher practical value compared to other algorithms.

Keywords: software-defined optical transport network; SDOTN; unified constraint expression; complex constraints; must pass links; loop-free path; path calculation; hierarchical topology; KSP; K-shortest path.

DOI: 10.1504/IJCAT.2025.148163

International Journal of Computer Applications in Technology, 2025 Vol.76 No.1/2, pp.83 - 93

Accepted: 19 Feb 2025
Published online: 27 Aug 2025 *

Full-text access for editors Full-text access for subscribers Free access Comment on this article