ENABLING DYNAMIC ROUTING TOPOLOGIES IN SUPPORT OF REAL-TIME DELAY TRAFFIC
First Claim
1. A method, comprising:
- determining a set of sources and used destinations for traffic in a computer network, wherein nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG);
determining a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node; and
instructing the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a device determines a set of sources and used destinations for traffic in a computer network, where nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG). The device may then also determine a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node, and instructs the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node.
-
Citations
25 Claims
-
1. A method, comprising:
-
determining a set of sources and used destinations for traffic in a computer network, wherein nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG); determining a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node; and instructing the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus, comprising:
-
one or more network interfaces to communicate in a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; determine a set of sources and used destinations for traffic in a computer network, wherein nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG); determine a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node; and instruct the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A method, comprising:
-
operating as a node in non-storing mode in a directed acyclic graph (DAG) where all traffic is sent through a root node according to the DAG; indicating a capability to operate in storing mode; s receiving instructions to operate in storing mode to store downward routes to forward traffic for one or more particular destinations according to the stored downward route rather than through the root node of the DAG; receiving traffic for a specific destination of the particular destinations; and
, in response,using a corresponding stored downward route to forward the traffic toward the specific destination. - View Dependent Claims (22, 23)
-
-
24. An apparatus, comprising:
-
one or more network interfaces to communicate in a computer network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store a process executable by the processor, the process when executed operable to; operate in non-storing mode in a directed acyclic graph (DAG) where all traffic is sent through a root node according to the DAG; indicate a capability to operate in storing mode; receive instructions to operate in storing mode to store downward routes to forward traffic for one or more particular destinations according to the stored downward route rather than through the root node of the DAG; receive traffic for a specific destination of the particular destinations; and
, in response,use a corresponding stored downward route to forward the traffic toward the specific destination. - View Dependent Claims (25)
-
Specification