Selective topology routing for distributed data collection
First Claim
1. A method, comprising:
- determining a traffic matrix of a mesh network, the traffic matrix indicating an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices;
selecting one or more optimized root devices from a plurality of capable devices in the mesh network for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic; and
transmitting a DAG formation request to the selected one or more optimized root devices, the DAG formation request carrying a characteristic for a corresponding DAG to be formed by the respective selected optimized root devices that indicates which one or more types of traffic correspond to the corresponding DAG.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a device, such as a network management server, determines a traffic matrix of a mesh network, where the traffic matrix indicates an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices. One or more optimized root devices may then be selected for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic. As such, a DAG formation request may be transmitted to the selected root devices, carrying a characteristic for a corresponding DAG to form by the respective selected root devices that indicates which one or more types of traffic correspond to the corresponding DAG.
40 Citations
20 Claims
-
1. A method, comprising:
-
determining a traffic matrix of a mesh network, the traffic matrix indicating an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices; selecting one or more optimized root devices from a plurality of capable devices in the mesh network for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic; and transmitting a DAG formation request to the selected one or more optimized root devices, the DAG formation request carrying a characteristic for a corresponding DAG to be formed by the respective selected optimized root devices that indicates which one or more types of traffic correspond to the corresponding DAG. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An apparatus, comprising:
-
one or more network interfaces to communicate with nodes of a mesh network; a processor coupled to the network interfaces and adapted to execute one or more processes; and a memory configured to store the one or more processes executable by the processor, the one or more processes when executed operable to; determine a traffic matrix of the mesh network, the traffic matrix indicating an amount of traffic per type of traffic transitioning between the mesh network and a global computer network via one or more current root devices; select one or more optimized root devices from a plurality of capable devices in the mesh network for corresponding directed acyclic graphs (DAGs) based on the amount of traffic and type of traffic; and transmit a DAG formation request to the selected one or more selected root devices, the DAG formation request carrying a characteristic for a corresponding DAG to be formed by the respective selected optimized root devices that indicates which one or more types of traffic correspond to the corresponding DAG. - View Dependent Claims (11, 12, 13, 14)
-
-
15. A method, comprising:
-
receiving a directed acyclic graph (DAG) formation request at a selected root device of a mesh network, the DAG formation request carrying a characteristic for a corresponding DAG to be formed by the selected root device that indicates which one or more types of traffic correspond to the corresponding DAG; initializing the corresponding DAG as requested in the DAG formation request; and advertising the characteristic for the corresponding DAG to indicate, to nodes in the mesh network joining the corresponding DAG, which one or more types of traffic are served by the corresponding DAG. - View Dependent Claims (16)
-
-
17. A method, comprising:
-
receiving, at a node in a mesh network, a first directed acyclic graph (DAG) advertisement having a first characteristic for a corresponding first DAG to join with that indicates a first type of traffic that is served by the first DAG; joining the first DAG; receiving, at the node, a second DAG advertisement having a second characteristic for a corresponding second DAG to join with that indicates a second type of traffic that is served by the second DAG; joining the second DAG; transmitting, by the node, traffic of the first type on the first DAG; and transmitting, by the node, traffic of the second type on the second DAG. - View Dependent Claims (18, 19, 20)
-
Specification