Redirecting traffic via tunnels to discovered data aggregators

• US 8,891,534 B2
• Filed: 06/20/2011
• Issued: 11/18/2014
• 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
• Primary Examiner(s): Phillips, Hassan
• Assistant Examiner(s): RAHGOZAR, OMEED DANIEL
• Application Number:
  US13/164,708
• Publication Number:
  US 20120320923A1
• Time in Patent Office: 1,247 Days
• Field of Search: None
• 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. 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 wherein the data aggregator is a node between a root node and a destination address node in the computer network that is equipped with sufficient memory to handle an aggregation task, the DAD message comprising a recorded route taken from the data aggregator to the particular node as well as a total path cost including at least one hop 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 the 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.

2. The method as in claim 1, further comprising:

selecting particular traffic to redirect via the data aggregator.

3. The method as in claim 2, wherein selected traffic to redirect is from a group consisting of:

all traffic, a specific type of traffic, a specific class of traffic, and traffic explicitly carrying an indication that it is to be aggregated.

4. The method as in claim 1, wherein redirecting traffic is in response to a particular event.

5. The method as in claim 4, wherein the particular event is from a group consisting of:

congestion of a DAG path to the root node, failure of a primary data aggregator other than the identified data aggregator of the DAD message, a request from the primary data aggregator, an explicit command received at the particular node, and an objective function (OF) for the DAG.

6. The method as in claim 1, further comprising:

determining the configured threshold for the PCI based on a particular reason for redirecting traffic.

7. The method as in claim 6, wherein the particular reason is from a group consisting of:

steady state operation to redirect traffic, a specific type of traffic, a specific class of traffic, traffic explicitly carrying an indication that it is to be aggregated, congestion of a DAG path to the root node, failure of a primary data aggregator other than the identified data aggregator of the DAD message, a request from the primary data aggregator, an explicit command received at the particular node, and an objective function (OF) for the DAG.

8. The method as in claim 1, further comprising:

receiving a plurality of DAD messages; and

determining one or more corresponding data aggregators to use based on the plurality of DAD messages.

9. The method as in claim 8, further comprising:

load-balancing redirected traffic to a plurality of data aggregators.

10. The method as in claim 1, further comprising:

propagating the DAD message into the computer network by the particular node, the propagated DAD message having an updated recorded route to include the particular node, as well as an updated total path cost for a subsequent receiving node to reach the root node through the updated recorded route and via the data aggregator.

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 wherein the data aggregator is a node between a root node and a destination address node in the computer network that is equipped with sufficient memory to handle an aggregation task, the DAD message comprising a recorded route taken from the data aggregator to the apparatus as well as a total path cost including at least one hop 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 the 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.

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

select particular traffic to redirect via the data aggregator.

13. The apparatus as in claim 11, wherein the process when executed to redirect traffic is further operable to:

redirect traffic in response to a particular event.

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

determine the configured threshold for the PCI based on a particular reason for redirecting traffic.

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

receive a plurality of DAD messages; and

determine one or more corresponding data aggregators to use based on the plurality of DAD messages.

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

propagate the DAD message into the computer network, the propagated DAD message having an updated recorded route to include the apparatus, as well as an updated total path cost for a subsequent receiving node to reach the root node through the updated recorded route and via the data aggregator.