Method and system for assigning spare transmission links to restoral routes

• US 5,999,103 A
• Filed: 06/30/1997
• Issued: 12/07/1999
• Est. Priority Date: 06/30/1997
• Status: Expired due to Term

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: MCI Communications Corporation (Verizon Communications Inc.)
• Inventors: Croslin, William D.
• Primary Examiner(s): Horabik, Michael
• Assistant Examiner(s): Asongwed, Anthony A.
• Application Number:
  US08/885,712
• Time in Patent Office: 890 Days
• Field of Search: 340/825.01, 340/825.03, 370/221, 370/223, 370/216, 370/225, 370/252, 370/227, 370/248, 370/228, 370/231, 370/329, 370/351, 370/238, 395/180, 395/181, 395/182.01
• US Class Current: 370/228
• CPC Class Codes: H04M 3/12 Marking faulty circuits "busy"; Enabling equipment to disengage itself from faulty circuits ; Using redundant circuits; Response of a circuit, apparatus or system to an error
• CPC Class Codes: H04M 3/2254 in networks

Abstract

A restoration system for restoring a communications network following a failure of one or more communications network components. The restoration system identifies spare segments and spans of spare segments in the original network configuration, as well as interconnected sub-spans of the identified spans of spare segments. The restoration system assigns a cost to the identified spare spans and spare segments. The costs are based on the cost of connecting a spare span or a segment as part of a restoral route and the cost of fragmenting a spare span. The restoration system uses these assigned costs to select a low cost combination of spare segments and spare spans to use as the restoral route.

Claims

1. A method in a computer system for determining a restoral route of a communications network following a failure, a communications network having segments and switching nodes that connect one segment to another, the segments being active or spare, the active segments being configured to carry signals and the spare segments being configured to not carry signals, the spare segments being interconnected by the switching nodes to form spans, the method comprising:

identifying parent spare spans within the communications network, each parent spare spans comprising one or more interconnected spare segments that are not interconnected to another segment;

for each identified parent spare span, identifying each child spare span, each child spare span being a sub-span of the parent spare span;

assigning cost to each identified parent spare span and child spare span, wherein the assigning of costs occur before detection of a network failure and identification of various combinations of parent spare spans and child spare spans occurs after detection of a network failure; and

when a failure is detected in an active segment,

selecting a restoration plan for the failed active segment, the restoration plan designating the switching nodes that can be used to bypass the failed active segment; and

determining a combination of the identified parent spare spans and identified child spare spans based on the assigned costs that can be used to implement the selected restoration plan.

2. The method of claim 1 wherein the assigning of the cost includes determining a length of each identified parent spare span and child spare span and a number of actions required to configure each identified parent spare span and child spare span to bypass the failure.

3. The method of claim 1 wherein the assigning of the cost includes calculating a switching cost associated with spare spans.

4. The method of claim I wherein the assigning of the cost includes calculating a fragmentation cost associated with a child spare span.

5. A method in a computer system for restoring a communications network following a failure, the communications network having active segments that carry signals between switching nodes and having spare segments that can be activated to carry signals between switching nodes, the method comprising:

identifying spare spans within the communications network, a spare span comprising one or more interconnected spare segments;

assigning a cost to each identified spare span, the cost being based on the number of connections in the spare span, wherein the assigning of cost occurs before detection of a network failure and identification of various combinations of spare spans occurs after detection of a network failure; and

following a failure of an active segment within the communications network,

selecting a combination of spare spans to bypass the failed active segment based on the assigned costs to the spare spans; and

connecting the selected combination of spare spans to bypass the failed active segment.

6. The method of claim 5 wherein the identifying of spare spans identifies each parent spare span, which comprises one or more interconnected spare segments that are not interconnected to another segment, and identifies each child spare span, which are sub-spans of the parent spare spans.

7. The method of claim 5 wherein the assigning of the cost includes assigning a cost based on resulting fragmentation of spare spans.

8. The method of claim 7 wherein the costs include the cost of disconnecting a sub-span from a spare span.

9. The method of claim 7 wherein the costs include a delayed cost of connecting a segment to a fragmented spare span.

10. A computer system for identifying a restoral route in a communications network to bypass a segment within the communications network, the communications network having active segments that carry signals between switching nodes and having spare segments that can be patched into the network to carry signals between switching nodes, the system comprising:

a component that identifies parent spare spans and child spare spans within the communications network;

a component that assigns a cost to each identified parent spare span and child spare span, wherein the assigning of costs occur before detection of a network failure, and identification of various combinations of parent spare spans and child spare spans occurs after detection of a network failure; and

a component that selects a combination of the identified spare spans to bypass the segment based on the assigned costs.

11. The system of claim 10 wherein a parent spare span comprises one or more interconnected segments that are connected only to the segments within the span and wherein a child spare span is a sub-span of a parent spare span.

12. The system of claim 10 wherein the costs are assigned based on the number of connections in the span.

13. The system of claim 10 wherein the costs are assigned based on fragmentation of a long spare span into shorter spare spans.

14. The system of claim 13 wherein the cost of fragmentation includes the cost of disconnecting a short spare span from a long spare span.

15. The system of claim 13 wherein the cost of fragmentation includes a delayed cost of connecting a fragmented long span to another segment.

16. The system of claim 10 including a component that patches the selected combination of spare spans into the communications network to bypass a failure.

17. The system of claim 10 wherein the component that selects the combination does so in response to detecting a network failure.

18. A method in a computer system for identifying a restoral route, the method comprising selecting a plurality of spare spans;

assigning a cost to each spare span based on fragmentation that occurs when the spare span is disconnected from a longer spare span;

identifying various combinations of the selected spare spans that can be used as the restoral route; and

identifying the combination with the lowest assigned costs as the restoral route wherein the assigning of costs occur before detection of a network failure, and the identification of various combinations of spare spans occurs after detection of a network failure said identification identifying all possible combinations of said spare spans.