METHOD AND MESSAGE THEREFOR OF MONITORING THE SPARE CAPACITY OF A DRA NETWORK

• US 20030133417A1
• Filed: 09/11/1998
• Published: 07/17/2003
• Est. Priority Date: 03/12/1997
• Status: Abandoned Application

• Current Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Original Assignee: Verizon Patent and Licensing Incorporated (Verizon Communications Inc.)
• Inventors: BADT, SIG H. Jr.
• Application Number:
  US09/152,008
• Publication Number:
  US 20030133417A1
• Time in Patent Office: Days
• US Class Current: 370/254
• CPC Class Codes: G06F 11/2289 by configuration test
• CPC Class Codes: H04J 2203/006 Fault tolerance and recovery
• CPC Class Codes: H04J 3/14 Monitoring arrangements for SDH/SONET rings H04J3/085
• CPC Class Codes: H04L 41/0654 using network fault recovery ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04Q 3/0062 Provisions for network management
• CPC Class Codes: H04Q 3/0079 involving restoration of networks, e.g. disaster recovery, self-healing networks

Abstract

To obtain a topology of the available spare links in a telecommunications network provisioned with a distributed restoration algorithm, messages containing the appropriate identifications of the nodes and the ports of the nodes to which spare links are connected are exchanged continuously along the spare links of the network. When a failure is detected, the origin node can retrieve the various messages, and from data contained therein, to construct a topology of the available spare links of the network which can then be used for finding an alternate route for rerouting the traffic disrupted by the failure.

Claims

1. A method of mapping a topology of the spare capacity of a distributed restoration algorithm (DRA) provisioned telecommunications network having a plurality of nodes interconnected with working and spare links, comprising the steps of:

a) outputting a message from each spare link of each of said nodes to the adjacent node to which said each spare link is connected;

b) identifying the port number of said each node from where said each spare link outputs said message and the port number of the adjacent node connected to said each spare link whereat said message is received;

c) storing as data the respective port numbers of all nodes that have connected thereto at least one spare link via which said message is either sent or received, the identifies of said all nodes and the spare links interconnecting said all nodes; and

d) generating from said stored data the topology of all spare links interconnecting the nodes of said network.

2. The method of claim 1, further comprising the steps of;

storing said data in a central processing means; and

providing said generated topology of the spare links of said network to the origin node for beginning the restoration process if a failure occurs in said network.

3. The method of claim 1, wherein when a failure occurs in said network, further comprising the step of:

transmitting from each of the custodial nodes of the failed link a message, via any functional spare links that it has, to nodes downstream thereof to inform said downstream nodes that it is a custodial node.

4. The method of claim 1, further comprising the steps of:

selecting one of the custodial nodes of a failed link to be the origin node; and

said origin node utilizing said topology of the spare capacity of said network to find an alternate route to reroute the disrupted traffic.

5. The method of claim 2, further comprising the steps of:

continuously updating the status of said message arriving at each spare port of the nodes of said network; and

storing said updated status in said central processing means;

wherein said central processing means is adaptable to use said updated status to provide a real time topology of the spare capacity of said network.

6. In a distributed restoration algorithm (DRA) provisioned telecommunications network having a plurality of nodes interconnected with working and spare links, a method of continuously monitoring the available spare capacity of said network, comprising the steps of:

a) generating keep alive messages;

b) continuously exchanging said keep alive messages on the spare links of said network when a DRA event is not in progress; and

c) recording the various spare ports that transmitted and received said keep alive messages to determine the number of spare links available in said network.

7. The method of claim 6, wherein said step c further comprises the step of:

generating each of said keep alive messages to include

a first field containing the identification number of the node that sent said message;

a second field containing the identification number of the port of said node whence said message is output;

a third field having an identifier that is set to a specific value when said node is one of the custodial nodes that bracket a failed link.

8. The method of claim 7, further comprising the step of:

generating each of said keep alive messages to include a fourth field

identifying said keep alive message to be a message that is continuously transmitted and exchanged along spare links between adjacent nodes of said network while a DRA process is not in progress.

9. In a distributed restoration algorithm (DRA) provisioned telecommunications network having a plurality of nodes interconnected with working and spare links, a message being transmitted between adjacent nodes of said network that are connected by at least one spare link for mapping the topology of the spare capacity of said network, comprising:

a first field containing the identification number of the node that sent said message;

a second field containing the identification number of the port of said node whence said message is output; and

a third field having an identifier that is set to a specific value when said node is one of the custodial nodes that bracket a failed link;

wherein, when there is a failed link, said message is broadcast from one of the custodial nodes that bracket said failed link.

10. The message of claim 9, wherein said message further comprises:

a fourth field for identifying said message to be a message that is continuously transmitted and exchanged along spare links between adjacent nodes of said network while a DRA process is not in progress.