Baker Botts L.L.P.
Determining disjoint paths with an optimized number of regenerators
According to particular embodiments, determining disjoint paths includes receiving a graph representing a network comprising nodes and links. The graph is transformed such that the number of intermediate nodes of a path indicates the number of regenerators for the path. A set of seed paths from a source node to a destination node of the transformed graph is generated. For each seed path, a shortest path from the source node to the destination node is determined to yield one or more pairs of disjoint paths from the source node to the destination node. An optimized pair of disjoint paths is selected, where the optimized pair of disjoint paths has an optimized number of regenerators.
Fujitsu Limited
H H H H
H04L H04L H04L H04L
inventional inventional inventional inventional
Xi Qiong Takao Paparao
Wang Zhang Naito Palacharla