FUTILE NEIGHBOR STATE LOOP PREVENTION IN HIGH AVAILABILITY NETWORKS
First Claim
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.
2 Assignments
0 Petitions
Accused Products
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.
8 Citations
15 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. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A computer program product comprising a computer usable medium embodying computer usable program code for detecting and managing a futile neighbor state loop during link state routing, the computer program product comprising:
-
computer usable program code for reading a threshold parameter for link state routing, wherein the threshold parameter indicates a number of routing attempts; computer usable program code for performing link state routing to a node via a primary interface; computer usable program code for 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; computer usable program code for detecting an available backup interface to the node; computer usable program code for suspending the primary interface to the node; and computer usable program code for switching routing to the backup interface. - View Dependent Claims (7, 8, 9, 10)
-
-
11. 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. - View Dependent Claims (12, 13, 14, 15)
-
Specification