Lookahead computation of routing information
First Claim
1. A method of reducing routing path convergence time in a network performed in a network node, the method comprising:
- generating an ordered set of predicted future network states, wherein the ordered set of predicted future states is ordered based on a likelihood of the network transitioning to each of the respective future network states;
determining the first future network state within the ordered set of predicted future network states for which routing information has not already been computed;
computing predicted routing information based on the first future network state;
storing the predicted routing information in association with the first future network state at the node;
receiving, at the node, an indication that a current network state has changed to a new network state from an old network state;
determining whether the node has access to pre-computed routing information associated with the new network stateif the node has access to pre-computed routing information associated with the new network state, using the pre-computed routing information to route future network traffic; and
if the node does not have access to pre-computed routing information associated with the new network state, computing new routing information and using the new routing information to route future network traffic.
14 Assignments
0 Petitions
Accused Products
Abstract
Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the node, an indication that a current network state has changed to a new network state from an old network state; determining whether the node has access to pre-computed routing information associated with the new network state; if the node has access to pre-computed routing information associated with the new network state, using the pre-computed routing information to route future network traffic; and if the node does not have access to pre-computed routing information associated with the new network state, computing new routing information and using the new routing information to route future network traffic.
-
Citations
20 Claims
-
1. A method of reducing routing path convergence time in a network performed in a network node, the method comprising:
-
generating an ordered set of predicted future network states, wherein the ordered set of predicted future states is ordered based on a likelihood of the network transitioning to each of the respective future network states; determining the first future network state within the ordered set of predicted future network states for which routing information has not already been computed; computing predicted routing information based on the first future network state; storing the predicted routing information in association with the first future network state at the node; receiving, at the node, an indication that a current network state has changed to a new network state from an old network state; determining whether the node has access to pre-computed routing information associated with the new network state if the node has access to pre-computed routing information associated with the new network state, using the pre-computed routing information to route future network traffic; and if the node does not have access to pre-computed routing information associated with the new network state, computing new routing information and using the new routing information to route future network traffic. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A network node that reduces routing path convergence time in a network, the network node comprising:
-
a processor; a first interface that receives network state information; and a network state predictor that predicts an ordered set of predicted future network states based on the network state information, wherein the ordered set of predicted future states is ordered based on a likelihood of the network transitioning to each of the respective future network states; and a routing information generator that generates at least one set of routing information based on the ordered set of predicted future network states. - View Dependent Claims (11, 12, 13, 14, 15, 16)
-
-
17. A non-transitory machine-readable storage medium encoded with instructions for reducing routing path convergence time in a network performed in a network node, the machine-readable storage medium comprising:
-
instructions for generating an ordered set of predicted future network states, wherein the ordered set of predicted future states is ordered based on a likelihood of the network transitioning to each of the respective future network states; instructions for determining a first future network state within the ordered set of predicted future network states for which routing information has not already been computed; instructions for computing predicted routing information based on the first future network state; instructions for storing the predicted routing information in association with the first future network state at the node; instructions for receiving, at the node, an indication that a current network state has changed to a new network state from an old network state; instructions for determining whether the node has access to pre-computed routing information associated with the new network state; instructions for, if the node has access to pre-computed routing information associated with the new network state, using the pre-computed routing information to route future network traffic; and instructions for, if the node does not have access to pre-computed routing information associated with the new network state, computing new routing information and using the new routing information to route future network traffic. - View Dependent Claims (18, 19, 20)
-
Specification