US 9,967,053 B2Granted

Shortest minimum regeneration path search in networks

AssigneeFujitsu Limited

InventorsInwoong Kim, Xi Wang, Qiong Zhang, Paparao Palacharla, Tadashi Ikeuchi

Life of this patent

Estimating the term…

Loading patent…

Abstract

Methods and systems are provided for determining a shortest minimum regeneration path in an optical network. The method includes creating a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links. The method includes traversing the virtual nodes, wherein traversing the virtual nodes comprises selecting an unvisited virtual node at a node; identifying a candidate virtual node from the unvisited virtual node; determining whether the candidate virtual node exceeds a maximum permitted weight; determining whether the candidate virtual node violates a shortest minimum regeneration path condition; and creating the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition.

Claims20

Dependent claims

A method for determining a shortest minimum regeneration path in an optical network, the method comprising:

creating a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links;
traversing the virtual nodes, wherein traversing the virtual nodes comprises:
selecting an unvisited virtual node at a node;
identifying a candidate virtual node from the unvisited virtual node, the candidate virtual node representing a new virtual node at the node and a neighboring node;
determining whether the candidate virtual node exceeds a maximum permitted weight;
determining whether the candidate virtual node violates a shortest minimum regeneration path condition, the shortest minimum regeneration path condition identifying virtual nodes that could not be part of the shortest minimum regeneration path;
creating the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition;
and
marking the unvisited virtual node as visited;
and
identifying a shortest minimum regeneration path between the source node and the destination node from the virtual nodes.

8 more elements

A control system for identifying the shortest minimum regeneration path, the control system comprising a processor having access to memory media storing instructions executable by the processor to:

create a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links;
select an unvisited virtual node at a node;
identify a candidate virtual node from the unvisited virtual node, the candidate virtual node representing a new virtual node at the node and a neighboring node;
determine whether the candidate virtual node exceeds a maximum permitted weight;
determine whether the candidate virtual node violates a shortest minimum regeneration path condition, the shortest minimum regeneration path condition identifying virtual nodes that could not be part of the shortest minimum regeneration path;
create the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition;
mark the unvisited virtual node as visited;
and
identify a shortest minimum regeneration path between the source node and the destination node from the virtual nodes.

6 more elements

Dependencies are inferred from the claim text.