Method and apparatus for load balancing internet traffic

• US 20080101233A1
• Filed: 10/25/2006
• Published: 05/01/2008
• Est. Priority Date: 10/25/2006
• Status: Abandoned Application

• Current Assignee: The Governors of the University of Alberta (University of Alberta)
• Original Assignee: The Governors of the University of Alberta (University of Alberta)
• Inventors: MacGregor, Michael H., Gburzynski, Pawel, Shi, Weiguang
• Application Number:
  US11/586,887
• Publication Number:
  US 20080101233A1
• Time in Patent Office: Days
• US Class Current: 370/235
• CPC Class Codes: G06F 9/505 considering the load

Abstract

A load balancer is provided wherein packets are transmitted to a burst distributor and a hash splitter. The burst distributor consults a flow table to make a determination as to which forwarding engine will receive the packet, and if the flow table is full, returns an invalid forwarding engine. A selector sends the packet to the forwarding engine returned by the burst distributor, unless the burst distributor returns an invalid forwarding engine, in which case the selector sends the packet to the forwarding engine selected by the hash splitter. The system is scalable by adding additional burst distributors and using a hash splitter to determine which burst distributor receives a packet.

Claims

1. A load balancer, comprising:

(a) a burst distributor,

(b) a hash splitter;

(c) a selector,

(d) a plurality of forwarding engines;

wherein said burst distributor receives a packet and selects one of said plurality of forwarding engines to transmit said packet, or selects an invalid forwarding engine to transmit said packet;

wherein said hash splitter also receives said packet;

said hash splitter selects one of said plurality of forwarding engines to transmit said packet; and

wherein said selector receives said packet from said burst distributor and said hash splitter, and sends said packet to said forwarding engine selected by said burst distributor if said forwarding engine selected by said burst distributor is valid; and

if said forwarding engine selected by said burst distributor is invalid, sending said packet to said forwarding engine selected by said hash splitter.

2. The load balancer of claim 1 wherein said burst distributor further comprises a flow table.

3. The load balancer of claim 2 wherein said burst distributor, on receipt of a packet, creates an entry in said flow table associated with said packet.

4. The load balancer of claim 3 wherein said entry in said flow table for said packet includes a flow associated with said packet.

5. The load balancer of claim 4 wherein said burst distributor, on transmitting said packet to said selector, tags said packet with information regarding said flow associated with said packet.

6. The load balancer of claim 5, wherein said forwarding engine selected by said selector, on transmitting said packet to a destination associated with said packet, transmits a message to said burst distributor.

7. The load balancer of claim 6 wherein, on receipt of said message from said forwarding engine selected by said selector, said burst distributor deletes said packet from said flow table.

8. The load balancer of claim 1 further comprising a second burst distributor, and a second hash splitter, wherein said second hash splitter determines which of said first and said second burst distributors receives said packet.

9. A method of balancing a flow of packets, comprising:

(a) a burst distributor and a hash splitter receiving a packet;

(b) said burst distributor selecting one of a plurality of forwarding engines to receive said packet, or selecting an invalid forwarding engine to receive said packet;

(c) said hash splitter selecting one of a plurality of forwarding engines to receive said packet;

(d) if said burst distributor selected one of said plurality of forwarding engines, sending said packet to said forwarding engines selected by said burst distributor; and

(e) if said burst distributor selected an invalid forwarding engine, sending said packet to said forwarding engine selected by said hash splitter.

10. The method of claim 9 wherein said burst distributor has a flow table.

11. The method of claim 10 further comprising:

said burst distributor, on receipt of a packet, creating an entry in said flow table associated with said packet.

12. The method of claim 11 wherein said entry in said flow table for said packet includes a flow associated with said packet.

13. The load balancer of claim 12 further comprising:

said burst distributor, on transmitting said packet to said forwarding engine selected by said load balancer, tagging said packet with information regarding said flow associated with said packet.

14. The load balancer of claim 13, further comprising:

said selected forwarding engine, on transmitting said packet to a destination associated with said packet, transmitting a message to said burst distributor.

15. The load balancer of claim 14 further comprising:

on receipt of said message from said selected forwarding engine, said burst distributor deleting said packet from said flow table.

16. A method of selecting a forwarding engine from a plurality of forwarding engines, comprising:

(a) providing a burst distributor having a flow table, said flow table having a plurality of records of packets, each of said packets associated with a flow, each of said flows associated with a forwarding engine;

(b) said burst distributor receiving a first packet, said first packet associated with a flow;

(c) searching said flow table for a second packet associated with said flow;

(d) if a second packet is located in said table, returning said forwarding engine associated with said flow that is associated with said second packet, to a selector;

(e) if said second packet is not located, determining if said flow table is full;

(f) if said flow table is not full, determining a forwarding engine within said plurality of forwarding engines having a minimum number of packets; and

returning said forwarding engine having a minimum number of packets to said selector; and

(g) if said flow table is full, returning an invalid forwarding engine to said selector.