Futile neighbor state loop prevention in high availability networks

• US 7,869,347 B2
• Filed: 06/19/2008
• Issued: 01/11/2011
• Est. Priority Date: 06/19/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Price, Marc W., Bell, Jon A.
• Primary Examiner(s): Mattis; Jason E
• Assistant Examiner(s): Clawson; Stephen J
• Application Number:
  US12/142,519
• Publication Number:
  US 20090316570A1
• Time in Patent Office: 936 Days
• Field of Search: 370/238
• US Class Current: 370/218
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery

Abstract

A method for detecting and managing a futile neighbor state loop during link state routing is disclosed. The method can include reading a threshold parameter for link state routing, wherein the threshold parameter indicates a number of routing attempts, and performing link state routing to a node via a primary interface. The method can further include detecting a futile neighbor state loop during link state routing to the node via the primary interface by detecting a number of routing attempts that has reached the threshold parameter and detecting an available backup interface to the node. The method can further include suspending the primary interface to the node and switching routing to the backup interface.

Claims

1. A method for detecting and managing a futile neighbor state loop during link state routing, comprising:

reading a threshold parameter for link state routing, wherein the threshold parameter indicates a number of routing attempts;

performing link state routing to a node via a primary interface;

detecting a futile neighbor state loop during link state routing to the node via the primary interface by detecting a number of routing attempts that has reached the threshold parameter;

detecting an available backup interface to the node;

suspending the primary interface to the node; and

switching routing to the backup interface, wherein the threshold parameter further indicates a pattern of link states.

2. The method of claim 1, wherein the futile neighbor state loop is detected by detecting a number of routing attempts that has reached the threshold parameter and by detecting a pattern of link states.

3. The method of claim 2, further comprising:

displaying a message indicating that a futile neighbor state loop has been detected in the primary interface to the node.

4. The method of claim 3, further comprising:

displaying a message indicating that an available backup interface to the node has been detected.

5. A computer program product, comprising a computer-readable storage-medium having stored therein computer usable program code for detecting and managing a futile neighbor state loop during link state routing, the computer usable program code, which when executed by a computer hardware system, causing the computer hardware system to perform:

reading a threshold parameter for link state routing, wherein the threshold parameter indicates a number of routing attempts;

performing link state routing to a node via a primary interface;

detecting a futile neighbor state loop during link state routing to the node via the primary interface by detecting a number of routing attempts that has reached the threshold parameter;

detecting an available backup interface to the node;

suspending the primary interface to the node; and

switching routing to the backup interface, wherein the threshold parameter further indicates a pattern of link states.

6. The computer program product of claim 5, wherein the futile neighbor state loop is detected by detecting a number of routing attempts that has reached the threshold parameter and by detecting a pattern of link states.

7. The computer program product of claim 6, further comprising:

displaying a message indicating that a futile neighbor state loop has been detected in the primary interface to the node.

8. The computer program product of claim 7, further comprising:

displaying a message indicating that an available backup interface to the node has been detected.

9. A method for detecting and managing a futile neighbor state loop during adjacency formation, comprising:

reading a threshold parameter for adjacency formation, wherein the threshold parameter indicates a pattern of link states;

performing adjacency formation with a node via a primary interface;

detecting a futile neighbor state loop during adjacency formation with the node via the primary interface by detecting the pattern of link states in the threshold parameter;

detecting an available backup interface to the node;

suspending the primary interface to the node; and

switching routing to the backup interface.

10. The method of claim 9, wherein the threshold parameter further indicates a number of routing attempts.

11. The method of claim 10, wherein the first step of detecting further comprises:

detecting a futile neighbor state loop during adjacency formation to the node via the primary interface by detecting the pattern of link states in the threshold parameter and a number of routing attempts that has reached the threshold parameter.

12. The method of claim 11, wherein the first step of detecting further comprises:

displaying a message indicating that a futile neighbor state loop has been detected in the primary interface to the node.

13. The method of claim 12, wherein the second step of detecting further comprises:

displaying a message indicating that an available backup interface to the node has been detected.

14. A computer hardware system for detecting and managing a futile neighbor state loop during link state routing, comprising:

a memory; and

at least one processor, the at least one processor configured to

read a threshold parameter for link state routing, wherein the threshold parameter indicates a number of routing attempts;

perform link state routing to a node via a primary interface;

detect a futile neighbor state loop during link state routing to the node via the primary interface by detecting a number of routing attempts that has reached the threshold parameter;

detect an available backup interface to the node;

suspend the primary interface to the node; and

switch routing to the backup interface, wherein the threshold parameter further indicates a pattern of link states.

15. The computer hardware system of claim 14 wherein

the futile neighbor state loop is detected by detecting a number of routing attempts that has reached the threshold parameter and by detecting a pattern of link states.

16. The computer hardware system of claim 15, wherein the at least one processor is further configured to:

display a message indicating that a futile neighbor state loop has been detected in the primary interface to the node.

17. The computer hardware system of claim 16, wherein the at least one processor is further configured to:

display a message indicating that an available backup interface to the node has been detected.