Failure restoration method in a mesh network

• US 5,550,805 A
• Filed: 02/08/1995
• Issued: 08/27/1996
• Est. Priority Date: 02/14/1994
• Status: Expired due to Fees

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Ashi, Yoshihiro, Takatori, Masahiro, Nakano, Yukio
• Primary Examiner(s): Chin, Wellington
• Application Number:
  US08/385,408
• Time in Patent Office: 566 Days
• Field of Search: 370/13, 370/16, 370/16.1, 370/85.14, 370/85.15, 370/94.1, 370/94.2, 370/94.3, 395/181, 395/182.01, 395/182.02, 395/183.19, 395/183.16
• US Class Current: 370/222
• CPC Class Codes: H04J 2203/006 Fault tolerance and recovery
• CPC Class Codes: H04J 3/085 for ring networks, e.g. SDH/SONET rings, self-healing rings, meashed SDH/SONET networks
• CPC Class Codes: H04J 3/14 Monitoring arrangements for SDH/SONET rings H04J3/085
• CPC Class Codes: H04L 1/22 using redundant apparatus to increase reliability
• CPC Class Codes: H04L 12/437 Ring fault isolation or reconfiguration for SDH/SONET ring networks H04J3/085
• CPC Class Codes: H04Q 3/0079 involving restoration of networks, e.g. disaster recovery, self-healing networks

Abstract

A method for constructing a network capable of self-healing from failure in a mesh network and a restoration algorithm are provided. A logical ring is set for each closed loop in the network, and when a failure occurs, the affected traffic is re-routed in the each logical ring toward the opposite direction away from the failure to restore the failed network. The network is divided into a plurality of logical rings to establish the restoration route so that time required for the restoration is shortened.

Claims

1. A method for restoring a failed mesh network in which each closed loop in the network is defined as a logical ring, each channel transmitted in multiplexed form in a transmission line is assigned to one of the logical rings, the channels belonging to the logical ring are divided into two groups, one being a working channel group and the other being a spare channel group, the method for restoring comprising the steps of:

normally transmitting a signal over working channels of a logical ring; and

when a failure occurs in a transmission line transmitting the affected traffic from one of the end nodes of the failed line to the other end node of the failed line by using the spare channel in said logical ring in which said failure occurs away from the failed line;

whereby the restoration from the failure is attained.

2. The method for restoring a failed mesh network according to claim 1 further comprising the step of:

exchanging messages, which contain identifiers of the nodes which detect the failure and identifiers of the traffic affected by the failure, between the nodes in each logical ring that belongs to the failed mesh network to conduct the restoring method automatically.

3. The method for restoring a failed mesh network according to claim 2 further comprising a step of:

assigning a logical channel number to a channel belonging to a logical ring;

informing all nodes in a logical ring of identifiers of logical channels passing through a logical ring.

4. The method for restoring a failed mesh network according to claim 2 wherein for a given logical ring each node holds information on identifiers of nodes that belong to the given logical ring.

5. The method for restoring a failed mesh network according to claim 2 wherein each node of a logical ring holds information of an entry node number and an exit node number of all traffic in the logical ring and when traffic is connected to an adjacent logical ring, each node of logical ring holds information on the identifier of the said adjacent logical ring and the logical channel number assigned to traffic in the said adjacent logical ring.

6. The method for restoring from failure in a mesh network according to claim 2 wherein all nodes in a logical ring hold information including identifiers of logical rings number that belong to the mesh network.

7. The method for restoring a failed mesh network according to claim 2 wherein when traffic is set to cross two logical rings in the mesh network, a route of the traffic passes through at least two nodes which belong to both of the two logical rings.

8. A method for restoring a failed mesh network according to claim 1 wherein said network uses a synchronous digital hierarchy (SDH) defined by the CCITT Recommendations G.707, 708 and 709 or synchronous optical network (SONET) defined by the ANSI T1.105.

9. A method for restoring a failed mesh network according to claim 8 wherein said channel is a virtual container (VC) defined by the CCITT Recommendations G.707, 708 and 709 or a synchronous transport signal level N synchronous payload envelope (STS-N SPE) defined by the ANSI T1.105.

10. A method for restoring a failed mesh network according to claim 8 wherein the transmission of the message between the nodes uses a path overhead in an SDH or a SONET frame.

11. A method for restoring a failed mesh network according to claim 8 wherein the transmission of the message between the nodes uses a data communication channel (DCC) in a section overhead of an SDH or a SONET frame.

12. A method for restoring a failed mesh network in which each closed loop in the network is defined as a logical ring, each channel transmitted in multiplexed form in a transmission line is assigned to one of the logical rings, the channels belonging to the logical ring are divided into two groups, one being a working channel group and the other being a spare channel group, the method for restoring comprising the steps of:

when a failure occurs in a logical ring and no node is disconnected from the logical ring by the failure or a node is disconnected but the affected traffic is connected to another node in the logical ring with the disconnected node, transmitting the affected traffic from one of end nodes of the failed segment in said logical ring to the other end node of the failed segment in said logical ring by using the spare channel in said logical ring away from the failed segment;

whereby the restoration from the failure is attained.

13. A method for restoring failed a mesh network in which each closed loop in the network is defined as a logical ring, each channel transmitted in multiplexed form in a transmission line is assigned to one of the logical rings, the channels belonging to the logical ring are divided into two groups, one being a working channel group and the other being a spare channel group, the method for restoring comprising the steps of:

when a failure occurs in a logical ring and a node is disconnected from the failed logical ring, and the affected traffic is connected to another logical ring which is adjacent to said failed logical ring, and the one end node of the failed segment in the failed logical ring also belongs to said another logical ring, connecting the affected traffic to the spare channel of said another logical ring at the failure detecting node belongs to the failed logical ring and transmitting the traffic to the other failure detecting node which belongs to said another logical ring;

whereby the restoration from the failure is attained.

14. A method for restoring a failed mesh network in which a closed loop in the network is defined as a logical ring, each channel transmitted in multiplexed form in a transmission line is assigned to one of the logical rings, the channels belonging to the logical ring are divided into two groups, one being a working channel group and the other being a spare channel group, the method for restoring comprising the steps of:

when a failure occurs in a logical ring and a node is disconnected from the failed logical ring and the affected traffic is connected to another logical ring in the node at which the said traffic is disconnected by the failure, and the failure detecting node in the failed logical ring does not belong to the another logical ring, connecting the said traffic to the spare channel of the failed logical ring, and transmitting the traffic to the failure detecting node that belongs to the another logical ring via a failure detecting node that belongs both the failed logical ring and the another logical ring;

whereby the restoration from the failure is attained.