Method and apparatus for node realignment in a telecommunications network

• US 9,686,188 B2
• Filed: 09/13/2012
• Issued: 06/20/2017
• Est. Priority Date: 09/13/2012
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Rebella, Paolo, Caviglia, Diego, Ceccarelli, Daniele
• Primary Examiner(s): Williams, Jenee
• Application Number:
  US14/428,076
• Publication Number:
  US 20150244614A1
• Time in Patent Office: 1,741 Days
• Field of Search: None
• CPC Class Codes: H04L 45/20 Hop count for routing purposes, e.g. TTL
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]

Abstract

A method of realigning a node in a label switched network comprising a plurality of nodes and a node with a processor, a memory, and a network interface, for carrying out the method. The method includes periodically maintaining backup path status information for the node, restarting the node, and re-establishing label switched paths with the plurality of nodes using the backup status information. Communication with adjacent nodes is carried out in order to reconcile the path status information with respective path status information in the adjacent nodes in order to establish node realignment preferably judged against a threshold value for path reliability.

Claims

1. A method of realigning a node in a label switched network comprising a plurality of nodes, the method comprising:

periodically maintaining backup status information for the node;

in response to restarting of the node, re-establishing label switched paths with the plurality of nodes using the backup status information; and

communicating with an adjacent node in order to establish a cumulative path reliability value for a path recorded in the backup status information using a reliability value, wherein the node sends a restart update message with the reliability value along the path and wherein a respective node of the plurality of nodes along the path modifies the reliability value when the path is recorded in the respective node'"'"'s backup status information, in which the cumulative path reliability value is obtained for the path based on a number of nodes modifying the reliability value, wherein when the cumulative path reliability value reaches a path reliability threshold value, the path is deemed reliable in order to establish node realignment, and when the cumulative path reliability value does not reach the path reliability threshold value, comparing base on a number of hops in the path and a number of nodes along the path which do not have the path recorded in their backup status information to the cumulative path reliability value to determine if the path is to be deleted.

2. The method as claimed in claim 1, wherein the path reliability threshold value is a function of the number of hops in the path.

3. A node for use in a label switched network comprising a plurality of nodes, wherein a restarting node of the plurality of nodes sends a restart update message with a reliability value along a path recorded in a backup status information of the restarting node and wherein a respective node of the plurality of nodes along the path modifies the reliability value when the path is recorded in the respective node'"'"'s backup status information, in which a cumulative path reliability value is obtained for the path based on a number of nodes modifying the reliability value along the path, wherein when the cumulative path reliability value reaches a path reliability threshold value, the path is deemed reliable in order to establish node realignment, and when the cumulative path reliability value does not reach the path reliability threshold value, comparing based on a number of hops in the path and a number of nodes along the path which do not have the path recorded in their backup status information to the cumulative path reliability value to determine if the path is to be deleted, the node comprising:

a processor operable periodically to create a backup status record for the node;

a memory coupled to the processor and arranged to store the backup status record;

a network interface coupled to the processor;

the processor arranged to re-start the node on command and to restore the node to a state defined by the backup status record;

the processor further arranged to receive, via the network interface, path reliability value based on the reliability value for the path from an adjacent node, modify the received path reliability value dependent on having the path recorded in the backup status record at the node, and send the modified path reliability value to another adjacent node along the path in order to obtain the cumulative path reliability value; and

the processor further arranged to receive, via the network interface, a node unaware value from the adjacent node based on a number of node or nodes which do not have the path recorded in their back status information, modify the received unaware value dependent on not having the path recorded in the backup status record at the node, and send the modified unaware value to another adjacent node along the path in order to obtain the number of nodes along the path which do not have the path recorded in their backup status information.

4. The node as claimed in claim 3, wherein the processor is arranged to modify an internally held path reliability value to establish the modified path reliability value for the path.

5. The node as claimed in claim 4, wherein the processor is arranged to calculate the path reliability threshold values as a function of the number of hops in the path.

6. A non-transitory machine-readable storage medium having computer code stored therein, which when executed by a set of one or more processors of a node in a label switched network comprising a plurality of nodes, causes the node to perform operations comprising:

periodically maintaining backup status information for the node;

in response to restarting of the node, re-establishing label switched paths with the plurality of nodes using the backup status information; and

communicating with an adjacent node in order to establish a cumulative path reliability value for a path recorded in the backup status information using a reliability value, wherein the node sends a restart update message with the reliability value along the path and wherein a respective node of the plurality of nodes along the path modifies the reliability value when the path is recorded in the respective node'"'"'s backup status information, in which the cumulative path reliability value is obtained for the path based on a number of nodes modifying the reliability value, wherein when the cumulative path reliability value reaches a path reliability threshold value, the path is deemed reliable in order to establish node realignment, and when the cumulative path reliability value does not reach the path reliability threshold value, comparing base on a number of hops in the path and a number of nodes along the path which do not have the path recorded in their backup status information to the cumulative path reliability value to determine if the path is to be deleted.