Controlling packet congestion

• US 7,636,308 B2
• Filed: 01/12/2005
• Issued: 12/22/2009
• Est. Priority Date: 03/03/2004
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Kwon, Il-Won
• Primary Examiner(s): Rao; Seema S
• Assistant Examiner(s): Wu; Jianye
• Application Number:
  US11/033,536
• Publication Number:
  US 20050195740A1
• Time in Patent Office: 1,805 Days
• Field of Search: 370/229, 370/235, 370/389, 370/401, 370/230.1, 370/252
• US Class Current: 370/230.1
• CPC Class Codes: H04L 43/0882 Utilisation of link capacity
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 47/12 Avoiding congestion; Recovering from congestion
• CPC Class Codes: H04L 47/29 using a combination of thresholds
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames

Abstract

A packet congestion control technique employs an Active Flow Random Early Drop (AFRED) method to provide a service requiring a predetermined bandwidth with a stable Quality of Service (QoS) even when network congestion occurs. The packet congestion control technique includes: receiving at least one packet flow; defining identifiers for the received at least one packet flow; numbering each of the defined at least one packet flow; calculating a queue length of each of the at least one packet flow; allocating a maximum queue threshold value, a minimum queue threshold value, and a maximum probability value of each of the at least one packet flow; and dropping or accepting an incoming packet of a flow according to the calculated packet drop probability upon a queue length of a currently received packet being between the maximum queue threshold value and the minimum queue threshold value.

Claims

1. A packet congestion control method comprising:

defining identifiers for a received at least one packet flow upon receiving the at least one packet flow;

calculating a queue length of each of the at least one packet flow;

allocating differently a maximum queue threshold value, a minimum queue threshold value, and a maximum probability value for each of the at least one packet flow, the maximum probability value being set to be as high as possible upon the at least one packet flow having burst characteristics;

setting a packet drop probability for each of the at least one packet flow in accordance with the maximum queue threshold value, the minimum queue threshold value, and the maximum probability value allocated differently for each of the at least one packet flow; and

dropping or accepting an incoming packet of a flow according to the set packet drop probability.

2. The method of claim 1,

dropping or accepting an incoming packet of a flow according to the set packet drop probability upon a queue length of a currently received packet being between the maximum queue threshold value and the minimum queue threshold value.

3. The method of claim 1, accepting all incoming packets of a flow regardless of the packet drop probability upon a queue length of a currently received packet being smaller than the minimum queue threshold value min_th.

4. The method of claim 1,

dropping all incoming packets of a flow regardless of the packet drop probability upon a queue length of a currently received packet being greater than the maximum queue threshold value max_th.

5. The method of claim 4, wherein each identifier is defined according to a traffic class.

6. The method of claim 1, wherein the minimum queue threshold value is increased to maintain a high use efficiency of a link, and the maximum queue threshold value is allocated to be as small as possible and at least twice as great as the minimum queue threshold value upon the at least one packet flow having burst characteristics.

7. The method of claim 1,

wherein, upon receiving the at least one packet flow:

defining identifiers for the received at least one packet flow; and

numbering each of the received at least one packet flow defined with the identifiers.

8. The method of claim 1, wherein the maximum probability value is increased to increase a packet drop rate upon the at least one packet flow having severe burst characteristics.

9. A program storage device, readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a packet congestion control method comprising:

defining identifiers for a received at least one packet flow upon receiving the at least one packet flow;

calculating a queue length of each of the at least one packet flow;

allocating differently a maximum queue threshold value, a minimum queue threshold value, and a maximum probability value for each of the at least one packet flow, the maximum probability value being set to be as high as possible upon the at least one packet flow having burst characteristics;

setting a packet drop probability for each of the at least one packet flow in accordance with the maximum queue threshold value, the minimum queue threshold value, and the maximum probability value allocated differently for each of the at least one packet flow; and

dropping or accepting an incoming packet of a flow according to the set packet drop probability.

10. The program storage device of claim 9, wherein the packet congestion control method further comprises:

dropping or accepting an incoming packet of a flow according to the set packet drop probability upon a queue length of a currently received packet being between the maximum queue threshold value and the minimum queue threshold value.

11. The program storage device of claim 9, wherein the a packet congestion control method further comprises:

accepting all incoming packets of a flow regardless of the packet drop probability upon a queue length of a currently received packet being smaller than the minimum queue threshold value min_th.

12. The program storage device of claim 9, wherein the a packet congestion control method further comprises:

dropping all incoming packets of a flow regardless of the packet drop probability upon a queue length of a currently received packet being greater than the maximum queue threshold value max_th.

13. The program storage device of claim 12, wherein each identifier is defined according to a traffic class.

14. The program storage device of claim 9, wherein upon the at least one packet flow having burst characteristics, the minimum queue threshold value is increased to maintain a high use efficiency of a link, and the maximum queue threshold value is allocated to be as small as possible and at least twice as great as the minimum queue threshold value.

15. The program storage device of claim 9,

wherein, upon receiving the at least one packet flow:

defining identifiers for the received at least one packet flow; and

numbering each of the received at least one packet flow defined with the identifiers.

16. The program storage device of claim 9, wherein upon the at least one packet flow having severe burst characteristics, the maximum probability value is increased to increase a packet drop rate.