Optimal path calculation method of optical network under complex constraints

Abstract

To address the optimal solution problem of loop‐free paths in software‐defined optical networks with multiple complex logical relationships, a unified constraint expression is utilized to describe the constraints. The logical relationships of complex constraints are dissected and simplified, differentiating between “AND” and “OR” constraints. An optimal path calculation method is proposed, involving the transformation of the network topology based on various constraints. This transformation includes layering the topology, removing specific links, and adding necessary links to portray the different complex constraints onto the original network structure. Following the topology transformation, an enhanced K‐shortest path algorithm is employed to compute the route satisfying the combination of multiple complex constraints, resulting in the global optimal solution. Experimental results demonstrate that this method can determine the optimal path under intricate constraints in a single computational iteration without requiring prior knowledge of the optimal constraint sequence. Therefore, it offers significant practical value compared to existing algorithms.