Restoration of IP networks using precalculated restoration routing tables

• US 20020167898A1
• Filed: 02/12/2002
• Published: 11/14/2002
• Est. Priority Date: 02/13/2001
• Status: Abandoned Application

• Current Assignee: Electronics and Telecommunications Research Institute
• Original Assignee: Electronics and Telecommunications Research Institute
• Inventors: Thang, Phi Cam, Alfa, Attanhiru Sule, Rueda, Jose Alejandro
• Application Number:
  US10/073,059
• Publication Number:
  US 20020167898A1
• Time in Patent Office: Days
• US Class Current: 370/216
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 69/40 for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection management of faults, events, alarms or notifications in data switching networks H04L41/06

Abstract

Fast restoration of an IP network in the event of a link failure is achieved, in advance of the conventional recalculation scheme which remains as a second phase of restoration, by pre-calculating for the network a minimum number of spanning trees arranged to provide alternative paths in the event that communication between two routers is determined to have failed, by providing routing tables based upon the spanning trees and by switching to the new routing tables when a link failure is detected using high speed detection at the physical layer to avoid delay. An algorithm is provided to calculate the spanning trees which are kept to a low number of two or three which is practical for storage in the memory of the routers.

Claims

1. A method of restoring an IP network in the event of a communication failure between two routers comprising:

providing an IP network comprising;

a plurality of routers;

a plurality of links between the routers for communication of data between each router and any other one of the routers, the links being arranged to provide between each router and each of the other routers at least two alternative paths;

the network being arranged such that each router is provided with a respective primary routing table by which there is provided for that router a respective one of a plurality of preferred paths selected from the alternative paths from that router to each of the other routers;

communicating the data between the routers using for routing the data the primary routing tables;

before a communication failure occurs, pre-calculating for the network a plurality of spanning trees arranged to provide alternative paths in the event that communication between two routers is determined to have failed;

for each of the calculated spanning trees, providing for each the routers a respective one of a plurality of restoration routing tables and storing in a memory associated with each router the plurality of restoration routing tables for that router in preparation for a communication failure;

detecting a fault indicative of a communication failure;

depending upon the two routers between which the communication is determined to have failed, selecting one of the spanning trees and the restoration routing tables associated with that spanning tree;

communicating to the routers an instruction to transfer routing from the primary routing table to the selected one of the pre-calculated restoration routing tables stored in the memory of the router;

and communicating the data between the routers using the selected, pre-calculated, stored restoration routing tables.

2. The method according to claim 1 wherein routing is transferred to the restoration tables substantially without delay.

3. The method according to claim 1 wherein there are two spanning trees and for each router two restoration tables.

4. The method according to claim 1 wherein there are three spanning trees and for each router three restoration tables.

5. The method according to claim 1 wherein the spanning trees are pre-calculated to minimize number of spanning trees necessary to restore all paths.

6. The method according to claim 1 wherein the spanning trees are pre-calculated by the algorithm specified in the specification.

7. The method according to claim 1 wherein, when a communication failure is detected by a router, that detection of a communication failure causes a communication to all other routers to use the restoration table.

8. The method according to claim 1 wherein, when a communication failure is detected by a router, that detection of a communication failure causes a communication only to edge routers and wherein the edge routers are arranged to modify the communicated data to communicate the requirement to use the restoration tables to internal routers.

9. The method according to claim 1 wherein the communicated data is modified by adding a tag.

10. The method according to claim 1 wherein the communicated data is modified by changing the information contained in the ANEP header.

11. The method according to claim 1 wherein the restoration tables form a first fault response system and there is provided a secondary fault response system in which, after a pre-determined delay after detection of a fault without the communication being restored, the primary router tables are recalculated taking into account the absence of the failed communication and the routers arranged to transfer routing back to the re-calculated primary routing tables.

12. The method according to claim 11 wherein primary routing table is re-calculated to provide optimum paths.

13. The method according to claim 11 wherein primary routing tables are re-calculated by the routers.

14. The method according to claim 1 wherein the fault detection is generated in response to a detection in the physical layer so as to be substantially without delay.