Controlling packet congestion

• US 20050195740A1
• Filed: 01/12/2005
• Published: 09/08/2005
• 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
• Granted Patent: US 7,636,308 B2
• Time in Patent Office: Days
• US Class Current: 370/229
• 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:

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;

setting a packet drop probability 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. A packet congestion control method comprising:

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 for each of the at least one packet flow;

setting a packet drop probability 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 upon a queue length of a currently received packet being between the maximum queue threshold value and the minimum queue threshold value.

3. A packet congestion control method comprising:

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 Random Early Detection (RED) parameters for each of the at least one packet flow;

calculating a packet drop probability using the allocated RED parameters; and

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

4. A packet congestion control method comprising:

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 for 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.

5. The method of claim 4, wherein each identifier is defined according to a traffic class classified by an Internet Protocol (IP) processing bit.

6. The method of claim 4, 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.

7. The method of claim 5, 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.

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

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

10. 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:

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;

setting a packet drop probability 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.

11. 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:

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 for each of the at least one packet flow;

setting a packet drop probability 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 upon a queue length of a currently received packet being between the maximum queue threshold value and the minimum queue threshold value.

12. 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:

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 Random Early Detection (RED) parameters for each of the at least one packet flow;

calculating a packet drop probability using the allocated RED parameters; and

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

13. 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:

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 for 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.

14. The program storage device of claim 13, wherein each identifier is defined according to a traffic class classified by an Internet Protocol (IP) processing bit.

15. The program storage device of claim 13, 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.

16. The program storage device of claim 14, 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.

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

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