REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS

• US 20150030033A1
• Filed: 09/02/2014
• Published: 01/29/2015
• Est. Priority Date: 06/20/2011
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Vasseur, Jean-Philippe, Shaffer, Shmuel, Shetty, Sandeep J.
• Granted Patent: US 9,356,858 B2
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/42 Centralised routing
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 40/246 Connectivity information discovery
• CPC Class Codes: H04W 40/26 for hybrid routing by combining proactive and reactive routing

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.

Claims

1-16. -16. (canceled)

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 including at least one hop 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.

18. The method as in claim 17, further comprising:

learning of one or more reporting groups configured to redirect traffic via the data aggregator, the reporting groups each associated with an exclusive time at which nodes of the reporting groups are configured to redirect traffic; and

allowing each of the one or more reporting groups to redirect traffic at least once prior to aggregating the redirected traffic.

19. The method as in claim 18, wherein the reporting groups are configured based on a location of the data aggregator within the DAG.

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 including at least one hop 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.

21. The apparatus as in claim 20, wherein the process when executed is further operable to:

learn of one or more reporting groups configured to redirect traffic via the apparatus as the data aggregator, the reporting groups each associated with an exclusive time at which nodes of the reporting groups are configured to redirect traffic; and

allow each of the one or more reporting groups to redirect traffic at least once prior to aggregating the redirected traffic.

22. The apparatus as in claim 21, wherein the reporting groups are configured based on a location of the apparatus as the data aggregator within the DAG.

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.

24. The method as in claim 23, wherein a particular data aggregator of the one or more data aggregators in the DAG corresponds to a plurality of reporting groups, and wherein the particular data aggregator is configured to allow each of the plurality of reporting groups to redirect traffic at least once prior to aggregating the redirected traffic.

25. 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;

determine a location of one or more data aggregators in a directed acyclic graph (DAG) of nodes in a computer network;

establish 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

assign 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

notify the assigned nodes and data aggregators of their associated reporting group.

26. The apparatus as in claim 25, wherein a particular data aggregator of the one or more data aggregators in the DAG corresponds to a plurality of reporting groups, and wherein the particular data aggregator is configured to allow each of the plurality of reporting groups to redirect traffic at least once prior to aggregating the redirected traffic.

27. The method as in claim 26, wherein the reporting groups are configured based on a location of the data aggregator within the DAG.