System and method for fast-rerouting of data in a data communication network

• US 20020112072A1
• Filed: 02/07/2002
• Published: 08/15/2002
• Est. Priority Date: 02/12/2001
• Status: Abandoned Application

• Current Assignee: Maple Optical Systems, Inc.
• Original Assignee: Maple Optical Systems, Inc.
• Inventors: Jain, Sudhanshu
• Application Number:
  US10/071,765
• Publication Number:
  US 20020112072A1
• Time in Patent Office: Days
• US Class Current: 709/239
• 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/02 Topology update or discovery
• CPC Class Codes: H04L 45/026 Details of "hello" or keep-alive messages
• 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 system and method for the fast re-routing of data in a data communication network. A protection label path is formed between a base node and an end node wherein the protection path avoids an intermediate node between the base node and the end node. Availability of protection provided by the protection path is advertised within the network. A protected path is formed for communicating data, the protected path passing through the intermediate node. When a fault is detected in the network, the fault is avoided by using the protection path for communicating data. Thus, alternate paths are defined for bypassing entire network nodes. As such, the protection paths allow data to be re-routed so as to avoid failed network nodes as well as failed network links.

Claims

1. A method of re-routing data traffic in a data communication network comprising:

forming a protection path between a base node and an end node wherein the protection path avoids an intermediate node between the base node and the end node;

advertising within the network availability of protection provided by the protection path;

forming a protected path for communicating data, the protected path passing through the intermediate node;

detecting a fault in the network; and

avoiding the fault by using the protection path for communicating data.

2. The method according to claim 1, the protection path having exactly two hops between the base node and the end node.

3. The method according to claim 1, the protection path having more than two hops between the base node and the end node.

4. The method according to claim 1, further comprising at least one additional protection path between the base node and the end node wherein the additional protection path avoids the intermediate node.

5. The method according to claim 1, wherein the fault affects the intermediate node.

6. The method according to claim 1, wherein the fault affects a network link connected to the intermediate node.

7. The method according to claim 1, the protected path being a label-switched path (LSP).

8. The method according to claim 1, said forming the protected path comprising sending a reservation message including a label for the protection path.

9. The method according to claim 8, wherein the reservation message also includes indicia of a possible point of failure in the network.

10. The method according to claim 9, wherein the indicia of a possible point of failure includes a first field for identifying a component of the network and a second field for identifying a sub-component of the component identified in the first field.

11. The method according to claim 9, wherein the possible point of failure includes the intermediate node.

13. The method according to claim 12, further comprising at least one additional protection path between the base node and the end node wherein the additional protection path avoids the intermediate node.

14. The method according to claim 12, wherein the fault affects the intermediate node.

15. The method according to claim 12, wherein the fault affects a network link connected to the intermediate node.

16. The method according to claim 12, the protected path being a label-switched path (LSP).

17. The method according to claim 12, said forming the protected path comprising sending a reservation message including a label for the protection path.

18. The method according to claim 17, wherein the reservation message also includes indicia of a possible point of failure in the network.

19. The method according to claim 18, wherein the indicia of a possible point of failure includes a first field for identifying a component of the network and a second field for identifying a sub-component of the component identified in the first field.

20. The method according to claim 18, wherein the possible point of failure includes the intermediate node.

12. A method of re-routing data traffic in a data communication network comprising:

identifying a base node in the network;

identifying an intermediate node in the network that is exactly one hop away from the base node;

identifying an end node in the network that is exactly one hop away from the intermediate node;

forming a protection path between the base node and the end node wherein the protection path avoids the intermediate node;

advertising within the network availability of protection provided by the protection path;

forming a protected path for communicating data, the protected path passing through the intermediate node;

detecting a fault in the network; and

avoiding the fault by using the protection path for communicating data.

21. A system for re-routing data traffic in a data communication network comprising a plurality of interconnected nodes, at least one node having stored indicia of a protection path, the protection path extending between a base node and an end node wherein the protection path avoids a intermediate node between the base node and the end node, and the system comprising a protected path for communicating data, the protected path passing through the intermediate node, wherein when a fault is detected, the fault is avoided by using the protected path.

22. The system according to claim 21, the protection path having two hops between the base node and the end node.

23. The system according to claim 21, the protection path having more than two hops between the base node and the end node.

24. The system according to claim 21, further comprising at least one additional protection path between the base node and the end node wherein the additional protection path avoids the intermediate node.

25. The system according to claim 21, wherein the fault affects the intermediate node.

26. The system according to claim 21, wherein the fault affects a network link connected to the intermediate node.

27. The system according to claim 21, the protected path being a label-switched path (LSP).

28. The system according to claim 21, the protected path is formed by sending a reservation message including a label for the protection path.

29. The system according to claim 28, wherein the reservation message also includes indicia of a possible point of failure in the network.

30. The system according to claim 29, wherein the indicia of a possible point of failure includes a first field for identifying a component of the network and a second field for identifying a sub-component of the component identified in the first field.

31. The system according to claim 30, wherein the possible point of failure includes the intermediate node.