Lesser disruptive open shortest path first handling of bidirectional forwarding detection state changes
First Claim
Patent Images
1. A computerized method comprising:
- receiving a link down event associated with a link fault protocol for a link between a first node and a neighboring node;
removing a data structure associated with the neighboring node from a forwarding table with a routing protocol running on the first node, in response to receiving the link down event;
reserving the data structure for adjacency recovery;
placing the neighboring node in the initialize state of the routing protocol;
resetting a penalty decay timer;
increasing a penalty associated with the penalty decay timer; and
triggering a kill neighbor event of the routing protocol for the first node that places the neighboring node in the down state if the penalty exceeds a threshold.
2 Assignments
0 Petitions
Accused Products
Abstract
A method and apparatus for processing link down events associated with links between adjacent nodes is described. A node receives link down events associated with a link fault protocol for a link between the node and a neighboring node. In response to receiving the link down event, the node removes a data structure associated with the neighboring node from a forwarding table associated with a routing protocol running on the node. The node reserves the data structure for speedy adjacency recovery. In addition, the node places the neighboring node in the initialize state of the routing protocol.
-
Citations
24 Claims
-
1. A computerized method comprising:
-
receiving a link down event associated with a link fault protocol for a link between a first node and a neighboring node; removing a data structure associated with the neighboring node from a forwarding table with a routing protocol running on the first node, in response to receiving the link down event; reserving the data structure for adjacency recovery; placing the neighboring node in the initialize state of the routing protocol; resetting a penalty decay timer; increasing a penalty associated with the penalty decay timer; and triggering a kill neighbor event of the routing protocol for the first node that places the neighboring node in the down state if the penalty exceeds a threshold. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory tangible machine-readable storage medium that stores computer executable instructions, which when executed by a set of one or more processors, cause said set of processors to perform operations comprising:
-
receiving a link down event associated with a link fault protocol for a link between a first node and a neighboring node; removing a data structure associated with the neighboring node from a forwarding table with a routing protocol running on the first node, in response to receiving the link down event; reserving the data structure for adjacency recovery; placing the neighboring node in the initialize state of the routing protocol; resetting a penalty decay timer; increasing a penalty associated with the penalty decay timer; and triggering a kill neighbor event of the routing protocol for the first node that places the neighboring node in the down state if the penalty exceeds a threshold. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. An apparatus comprising:
-
a link state change module to generate a link down event; and a routing table module to receive the link down event associated with a link fault protocol for a link between a first node and a neighboring node, remove a data structure associated with the neighboring node from a forwarding table with a routing protocol running on the first node, in response to receiving the link down event, reserve the data structure for adjacency recovery, place the neighboring node in the initialize state of the routing protocol, a timer module to reset a penalty decay timer and increase a penalty associated with the penalty decay timer, and wherein the routing table module triggers a kill neighbor event of the routing protocol for the first node that places the neighboring node in the down state if the penalty exceeds a threshold. - View Dependent Claims (18, 19, 20)
-
-
21. A network element comprising:
-
a set of one or more line cards, wherein each line card is configured to, receive a link down event associated with a link fault protocol for a link between a first node and a neighboring node, remove a data structure associated with the neighboring node from a forwarding table with a routing protocol running on the first node, in response to receiving the link down event, reserve the data structure for adjacency recovery, and place the neighboring node in the initialize state of the routing protocol; a set of one or more control cards, the control cards to control forwarding of packets between the set of one or more line cards; wherein the each line card is configured to reset a penalty decay timer and increase a penalty associated with the penalty decay timer; and
wherein the each line card is configured to trigger a kill neighbor event of the routing protocol for the first node that places the neighboring node in the down state if the penalty exceeds a threshold. - View Dependent Claims (22, 23, 24)
-
Specification