REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS
First Claim
1. A method, comprising:
- receiving a data aggregator discovery (DAD) message at a particular node in a directed acyclic graph (DAG) of a computer network, the DAD message initiated by a data aggregator identified in the DAD message, the DAD message comprising a recorded route taken from the data aggregator to the particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator;
determining a path cost increase (PCI) associated with use of the data aggregator based on the total path cost within DAD message as compared to a DAG-based path cost for the particular node to reach the root node via the DAG; and
redirecting traffic from the particular node to the data aggregator in response to the PCI being below a configured threshold, the traffic redirected as source-routed traffic according to the recorded route in the DAD message.
1 Assignment
0 Petitions
Accused Products
Abstract
In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly.
-
Citations
24 Claims
-
1. A method, comprising:
-
receiving a data aggregator discovery (DAD) message at a particular node in a directed acyclic graph (DAG) of a computer network, the DAD message initiated by a data aggregator identified in the DAD message, the DAD message comprising a recorded route taken from the data aggregator to the particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator; determining a path cost increase (PCI) associated with use of the data aggregator based on the total path cost within DAD message as compared to a DAG-based path cost for the particular node to reach the root node via the DAG; and redirecting traffic from the particular node to the data aggregator in response to the PCI being below a configured threshold, the traffic redirected as source-routed traffic according to the recorded route in the DAD message. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus, comprising:
-
one or more network interfaces to communicate within a directed acyclic graph (DAG) 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; receive a data aggregator discovery (DAD) message, the DAD message initiated by a data aggregator identified in the DAD message, the DAD message comprising a recorded route taken from the data aggregator to the apparatus as well as a total path cost for the apparatus to reach a root node of the DAG through the recorded route and via the data aggregator; determine a path cost increase (PCI) associated with use of the data aggregator based on the total path cost within DAD message as compared to a DAG-based path cost for the apparatus to reach the root node via the DAG; and redirect traffic to the data aggregator in response to the PCI being below a configured threshold, the traffic redirected as source-routed traffic according to the recorded route in the DAD message. - View Dependent Claims (12, 13, 14, 15, 16)
-
-
17. A method, comprising:
-
generating a data aggregator discovery (DAD) message by a data aggregator in a directed acyclic graph (DAG) of a computer network, the DAD message identifying the data aggregator and configured to carry a recorded route taken from the data aggregator to corresponding receiving nodes as well as a total path cost for the corresponding receiving node to reach a root node of the DAG through the recorded route and via the data aggregator; distributing the DAD message into the computer network without regard to the DAG; receiving redirected traffic from one or more of the corresponding receiving nodes, the received redirected traffic being source-routed traffic according to the recorded route in the DAD message; and aggregating the redirected traffic. - View Dependent Claims (18, 19)
-
-
20. An apparatus, comprising:
-
one or more network interfaces to communicate within a directed acyclic graph (DAG) 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; generate a data aggregator discovery (DAD) message in a directed acyclic graph (DAG) of a computer network, the DAD message identifying the apparatus as a data aggregator and configured to carry a recorded route taken from the apparatus to corresponding receiving nodes as well as a total path cost for the corresponding receiving node to reach a root node of the DAG through the recorded route and via the apparatus as the data aggregator; distribute the DAD message into the computer network without regard to the DAG; receive redirected traffic from one or more of the corresponding receiving nodes, the received redirected traffic being source-routed traffic according to the recorded route in the DAD message; and aggregate the redirected traffic. - View Dependent Claims (21, 22)
-
-
23. A method, comprising:
-
determining a location of one or more data aggregators in a directed acyclic graph (DAG) of nodes in a computer network; establishing one or more reporting groups based on the location of the one or more data aggregators in the DAG, the reporting groups each associated with an exclusive time at which nodes of the reporting groups are configured to redirect traffic, each reporting group based locally on a corresponding data aggregator; and assigning nodes within the DAG to an associated reporting group, the nodes configured to redirect traffic to a root node of the DAG via the corresponding data aggregator of the reporting group; and notifying the assigned nodes and data aggregators of their associated reporting group. - View Dependent Claims (24)
-
Specification