Network traffic distribution across parallel paths

• US 7,633,871 B1
• Filed: 02/21/2007
• Issued: 12/15/2009
• Est. Priority Date: 07/29/2002
• Status: Active Grant

• Current Assignee: Juniper Networks Incorporated
• Original Assignee: Juniper Networks Incorporated
• Inventors: Callon, Ross W.
• Primary Examiner(s): Yao; Kwang B
• Assistant Examiner(s): Lai; Andrew
• Application Number:
  US11/677,317
• Time in Patent Office: 1,028 Days
• Field of Search: 370229-232, 370/235, 370/237, 370/248
• US Class Current: 370/235
• CPC Class Codes: H04L 2012/5624 Path aspects, e.g. path bundling
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering

Abstract

Techniques are described for distributing network traffic across parallel data paths. For example, a router may perform a hash on routing information of the packet to generate a hash value corresponding to the packet flow associated with the packet. The router may map the hash value of the packet to a forwarding element associated with a data path. The router may dynamically update the mapping of hash values to forwarding elements in accordance with traffic flow statistics. In this manner, the router may distribute the packet flows from data paths with high volumes of traffic to data paths with smaller volumes of traffic. The router may further prevent out of sequence delivery of packets by updating the mapping upon a gap in the packet flow exceeding a threshold gap. For example, the router may update the mapping when a packet for a packet flow associated with the particular hash value has not been received for at least a defined time interval.

Claims

1. A method comprising:

distributing packet flows across a set of data paths in accordance with a distribution map that associates hash values with forwarding elements, wherein the packet flows include a first packet flow having a first hash value associated with a first forwarding element by the distribution map;

identifying a gap in which no packet was received for the first packet flow for at least a defined threshold length of time;

upon identifying the gap, selecting a second forwarding element based on traffic flow statistics for the packet flows and reassigning the first packet flow to the second forwarding element by updating the distribution map to associate the first hash value to the second forwarding element;

after updating the distribution map to reassign the first packet flow, receiving additional packets for the first packet flow; and

forwarding the additional packets of the reassigned first packet flow using the second forwarding element.

2. The method of claim 1, wherein the forwarding elements comprise next hops along network data paths, and updating the distribution map comprises updating the distribution map to associate the first hash value to a second next hop.

3. The method of claim 1, wherein the forwarding elements comprise interconnects coupling input interfaces of a routing device to output interfaces of the routing device, and updating the distribution map comprises updating the distribution map to associate the first hash value to a second interconnect.

4. The method of claim 1, further comprising:

collecting traffic flow statistics for each of the hash values,

wherein selecting a second forwarding element based on traffic flow statistics comprises selecting a second forwarding element that corresponds to one of the data paths with lower levels of traffic in accordance with the traffic flow statistics.

5. The method of claim 1, wherein identifying the gap includes:

setting a counter associated with the first hash value to a defined value upon receiving a packet for the first packet flow; and

incrementing the counter periodically by an increment value to track a length of the gap.

6. The method of claim 1, wherein identifying the gap includes:

setting a timestamp associated with the first hash value upon receiving a packet for the first packet flow; and

comparing the timestamp with the current time to determine a length of the gap.

7. The method of claim 1, wherein distributing packet flows comprises:

applying a hash function to routing information of each of the packets to generate a respective hash value, wherein the routing information includes a source address, a destination address and at least one additional parameter selected from the set of a protocol, a source port, and a destination port;

selecting forwarding elements for the packets in accordance with the respective hash values; and

forwarding the packets to the selected forwarding elements.

8. The method of claim 1, wherein the distribution map includes a hash map that associates hash values with pointers and relay information that associates the pointers with the forwarding elements.

9. A system comprising:

at least one input interface for receiving packet flows from a network;

a distribution map that associates a plurality of hash values with forwarding elements, wherein the forwarding elements are associated with different parallel data paths from a source to a destination; and

a control unit that;

distributes the packet flows across the parallel data paths in accordance with the distribution map, wherein the packet flows include a first packet flow having a first hash value associated with a first forwarding element by the distribution map;

collects traffic statistics for each of the hash values;

identifies a gap in which no packet was received for the first packet flow for at least a defined threshold length of time;

upon identifying the gap, selects a second forwarding element based on the collected traffic flow statistics for the packet flows and reassigns the first packet flow to the second forwarding element by updating the distribution map to associate the first hash value to the second forwarding element;

after updating the distribution map to reassign the first packet flow, receives additional packets for the first packet flow; and

forwards the additional packets of the reassigned first packet flow using the second forwarding element.

10. The system of claim 9, wherein the distribution map includes:

a hash map to associate packet flows with pointers to forwarding elements; and

a set of relay information to associate the pointers with the forwarding elements.

11. The system of claim 9, wherein the control unit further maintains gap statistics for each of the hash values to track the amount of time since receiving a packet for each of the packet flows.

12. The system of claim 11, wherein the control unit maintains gap statistics by setting a timestamp associated with the packet flows, and comparing the timestamps with the current time.

13. The system of claim 11, wherein the control unit maintains gap statistics by associating a counter with each of the packet flows.

14. The system of claim 9, wherein the forwarding elements comprise next hops along network data paths, and the control unit updates the distribution map to reassign the first hash value to a second next hop.

15. The system of claim 9, wherein the forwarding elements comprise interconnects coupling the input interface to at least one output interface, and the control unit updates the distribution map to reassign the first hash value to a second interconnect.

16. The system of claim 9, wherein the control unit selects a second forwarding element that corresponds to one of the data paths with lower levels of traffic in accordance with the traffic statistics.

17. A computer-readable medium comprising instructions to cause a processor to:

distribute packet flows across a set of data paths in accordance with a distribution map that associates hash values with forwarding elements, wherein the packet flows include a first packet flow having a first hash value associated with a first forwarding element by the distribution map;

identify a gap in which no packet was received for the first packet flow for at least a defined threshold length of time;

upon identifying the gap, select a second forwarding element based on traffic flow statistics for the packet flows and reassign the first packet flow to the second forwarding element by updating the distribution map to associate the first hash value to the second forwarding element;

after updating the distribution map to reassign the first packet flow, receive additional packets for the first packet flow; and

forward the additional packets of the reassigned first packet flow using the second forwarding element.