Partitioning directed acyclic graph (DAG) topologies
First Claim
1. A method, comprising:
- monitoring network statistics for a first directed acyclic graph (DAG) from a first root node;
determining a trigger to partition the first DAG based on the network statistics;
in response to the trigger, selecting a candidate second root node for each of one or more DAG partitions; and
requesting, by the first root node, that each selected second root node establish a new DAG partition with the respective second root node itself as the root of their new DAG, wherein nodes of the first DAG one of either remain with the first DAG or attach to the new DAG partition based on one or more metrics associated with each respective root.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, network statistics may be monitored for a first directed acyclic graph (DAG) from a first root node, and based on those network statistics, a trigger may be determined to partition the first DAG. As such, a candidate second root node may be selected for each of one or more DAG partitions, and a tunnel may be established between the first root node and the one or more second root nodes. Each second root node may then establish a new DAG partition with itself as the root (and with the same DAG parameters as the first DAG), wherein nodes of the first DAG remain with the first DAG or attach to the new DAG partition based on one or more metrics associated with each respective root (e.g., reachability, cost, DAG rank, etc.).
-
Citations
24 Claims
-
1. A method, comprising:
-
monitoring network statistics for a first directed acyclic graph (DAG) from a first root node; determining a trigger to partition the first DAG based on the network statistics; in response to the trigger, selecting a candidate second root node for each of one or more DAG partitions; and requesting, by the first root node, that each selected second root node establish a new DAG partition with the respective second root node itself as the root of their new DAG, wherein nodes of the first DAG one of either remain with the first DAG or attach to the new DAG partition based on one or more metrics associated with each respective root. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An apparatus, comprising:
-
one or more network interfaces; 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 as a first root node of a first directed acyclic graph (DAG); monitor network statistics for the first DAG; determine a trigger to partition the first DAG based on the network statistics; select a candidate second root node for each of one or more DAG partitions in response to the trigger; and request that each selected second root node establish a new DAG partition with the respective second root node itself as the root of their new DAG, wherein nodes of the first DAG one of either remain with the first DAG or attach to the new DAG partition based on one or more metrics associated with each respective root. - View Dependent Claims (9, 10, 11, 12, 13)
-
-
14. A method, comprising:
-
receiving, at a candidate second root node, a request from a first root node of a first directed acyclic graph (DAG) to establish a second DAG partition; determining DAG configuration parameters of the first DAG; establishing, by the candidate root node, a second DAG partition with itself as the root of the second DAG, the second DAG partition established with the DAG configuration parameters of the first DAG; and maintaining the second DAG such that nodes of the first DAG one of either remain with the first DAG or attach to the second DAG partition based on one or more metrics associated with the first root node and the second root node. - View Dependent Claims (15, 16, 17, 18, 19)
-
-
20. An apparatus, comprising:
-
one or more network interfaces; 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; receive a request from a first root node of a first directed acyclic graph (DAG) to establish a second DAG partition; determine DAG configuration parameters of the first DAG; establish a second DAG partition with the apparatus itself as the root of the second DAG, the second DAG partition established with the DAG configuration parameters of the first DAG; and maintain the second DAG such that nodes of the first DAG one of either remain with the first DAG or attach to the second DAG partition based on one or more metrics associated with the first root node and the apparatus. - View Dependent Claims (21, 22, 23, 24)
-
Specification