Allocating priority levels in a data flow

• US 20040199655A1
• Filed: 04/03/2003
• Published: 10/07/2004
• Est. Priority Date: 10/03/2000
• Status: Active Grant

• Current Assignee: Gos Holdings Limited
• Original Assignee: U4EA Technologies Limited
• Inventors: Lafave, Laura Anne, Vowden, Christopher James, Thompson, Peter William, Holyer, Judith Yvonne, Davies, Neil James
• Granted Patent: US 7,970,888 B2
• Time in Patent Office: Days
• US Class Current: 709/231
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/20 Traffic policing
• CPC Class Codes: H04L 47/22 Traffic shaping
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/25 with rate being modified by the source upon detecting a change of network conditions
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A method of allocating a priority level in an information flow in a data transmission system including receiving a plurality of data packets and allocating a priority level to each data packet is provided with a controller employing such method. The priority level may be determined in accordance with determining a class of loss of the data packet and a class of service for the data packet. The priority level is also a function of the current load of the information flow. It has been established that the choice for each degree of freedom should preferably be made independently and concurrently. The invention, therefore, provides a method for performing such a composite choice.

Claims

1. A method of allocating a priority level in an information flow in a data transmission system, comprising:

receiving a plurality of data packets; and

allocating a priority level to each data packet by determining a class of loss for the data packet, a class of urgency of service for the data packet, and further in accordance with a current load of the information flow.

2. The method as recited in claim 1 further comprising generating a modified information flow by providing a variable spacing between the data packets.

3. The method as recited in claim 2 wherein the variable spacing between data packets is random.

4. The method as recited in claim 2 wherein the variable spacing between data packets is exponentially distributed.

5. The method as recited in claim 1 wherein a spacing between at least some of the data packets corresponds to a spacing in the information flow.

6. The method as recited in claim 1 wherein the act of allocating the priority level is further in accordance with a state of a queue that the data packets are selectively admitted.

7. The method as recited in claim 1 further comprising selectively admitted each data packet to at least one of a plurality of queues and multiplexing an output of the queues.

8. The method as recited in claim 1 further comprising selectively discarding data packets.

9. The method as recited in claim 1 further comprising allocating a data packet identifier to each data packet and storing each data packet in a sequence.

10. The method as recited in claim 1 further comprising servicing each data packet based on the priority level and outputting each data packet in a sequence.

11. A controller for allocating a priority level in an information flow, comprising:

means for allocating a priority level to each data packet including determining a class of loss for the data packet and determining a class of urgency for the data packet, the priority level further being in accordance with a current load of the information flow.

12. The controller as recited in claim 11 further comprising means for generating a modified information flow by providing a variable spacing between the data packets.

13. The controller as recited in claim 12 wherein the means for generating a modified information flow is embodied at least in part in a policer/shaper.

14. The controller as recited in claim 12 wherein the means for generating a modified information flow employs one of a random pattern and a pseudo-random pattern.

15. The controller as recited in claim 11 further comprising means for selectively admitting a data packet to a queue.

16. A controller for allocating a priority level in an information flow, comprising:

a policer/shaper configured to allocate a priority level to each data packet including determining a class of loss for the data packet and determining a class of urgency for the data packet, the priority level further being in accordance with a current load of the information flow.

17. The controller as recited in claim 16 wherein the policer/shaper is configured to generate a modified information flow by employing a variable spacing between the data packets.

18. The controller as recited in claim 17 wherein the policer/shaper employs one of a random pattern and a pseudo-random pattern.

19. The controller as recited in claim 16 further comprising queue memory manager configured to selectively admit a data packet to a queue.

20. The controller as recited in claim 16 wherein the controller is configured to generate a plurality of information flows, the controller including a cherish/urgency multiplexer for multiplexing the information flows into a cascaded arrangement.