Allocating priority levels in a data flow
First Claim
1. A method of allocating a priority level in an information flow in a data transmission system, comprising:
- receiving, at a controller, a plurality of data packets;
selectively admitting the data packets to at least one queue; and
allocating, at the controller, a priority level to each of said plurality of data packets by determining a class of loss for the data packet and a class of urgency of service for the data packet, wherein the priority levels are allocated based on;
a function of a current state of said at least one queue to which the data packets are selectively admitted, such that the priority levels are allocated in dependence on the current load of the information flow, anda probabilistic choice according to the current state of the at least one queue, wherein the at least one queue has a set of predefined states, each predefined state being associated with a probability of a packet being allocated a particular priority level.
4 Assignments
0 Petitions
Accused Products
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.
-
Citations
17 Claims
-
1. A method of allocating a priority level in an information flow in a data transmission system, comprising:
-
receiving, at a controller, a plurality of data packets; selectively admitting the data packets to at least one queue; and allocating, at the controller, a priority level to each of said plurality of data packets by determining a class of loss for the data packet and a class of urgency of service for the data packet, wherein the priority levels are allocated based on; a function of a current state of said at least one queue to which the data packets are selectively admitted, such that the priority levels are allocated in dependence on the current load of the information flow, and a probabilistic choice according to the current state of the at least one queue, wherein the at least one queue has a set of predefined states, each predefined state being associated with a probability of a packet being allocated a particular priority level. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A controller for allocating a priority level in an information flow, comprising:
-
means for receiving a plurality of data packets; means for selectively admitting the data packets to at least one queue; and means for allocating a priority level to each of said plurality of data packets packet including determining a class of loss for the data packet and determining a class of urgency for the data packet, the priority levels being allocated based on; a function of a current state of said at least one queue to which the data packets are selectively admitted, such that the priority levels are allocated in dependence on the current load of the information flow, and a probabilistic choice according to the current state of the at least one queue, wherein the at least one queue has a set of predefined states, each predefined state being associated with a probability of a packet being allocated a particular priority level. - View Dependent Claims (11, 12, 13)
-
-
14. A controller for allocating a priority level in an information flow, comprising:
-
a policer/shaper configured to receive a plurality of data packets, and configured to allocate a priority level to each of said plurality of data packets including determining a class of loss for the data packet and determining a class of urgency for the data packet; and a queue memory manager configured to selectively admit the data packets to at least one queue; wherein the policer/shaper is further configured to allocate the priority levels based on; a function of a current state of said at least one queue to which the data packets are selectively admitted, such that the priority levels are allocated in dependence on the current load of the information flow, and a probabilistic choice according to the current state of the at least one queue, wherein the at least one queue has a set of predefined states, each predefined state being associated with a probability of a packet being allocated a particular priority level. - View Dependent Claims (15, 16, 17)
-
Specification