Abstract
A method of processing queued data packets in a packet data communication system is provided. The method includes allocating a tier of service for substantially each of a plurality of individual packet data queues and determining a total number of data packets that can use an available communication resource. A proportion of a total number of data packets is allocated to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource. A communication resource is provided to queued packet data users on a tier-by-tier basis such that the communication resource is made available to substantially all tiers.
Technologies
Resource configuration
Product
Use Cases
Wireless communication
Services
Claim
1. A method of processing queued data packets in a packet data communication system, the method comprising:
allocating a tier of service for each of a plurality of individual packet data queues, wherein allocating a tier of service comprises:
determining a total number of data packets that can use an available communication resource;
allocating different weights to each tier of service based on a number of users requiring access to the available communication resource;
allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource; and
providing said communication resource to queued packet data users on a tier-by-tier basis, such that said communication resource is made available to a number of tiers.', 'allocating a tier of service for each of a plurality of individual packet data queues, wherein allocating a tier of service comprises:', 'determining a total number of data packets that can use an available communication resource;', 'allocating different weights to each tier of service based on a number of users requiring access to the available communication resource;', 'allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource; and', 'providing said communication resource to queued packet data users on a tier-by-tier basis, such that said communication resource is made available to a number of tiers.
2. The method of processing queued data packets in a packet data communication system according to claim 1, wherein said allocating a proportion of a total number of data packets further comprises:
providing a commitment that a proportion of an entire communication system bandwidth is allocated to users operating on a particular tier.', 'providing a commitment that a proportion of an entire communication system bandwidth is allocated to users operating on a particular tier.
3. The method of processing queued data packets in a packet data communication system according to claim 1, the method further comprising:
allocating different weights to each tier of service to provide a differential level of service in the allocation of said communication resource between said tiers.', 'allocating different weights to each tier of service to provide a differential level of service in the allocation of said communication resource between said tiers.
4. The method of processing queued data packets in a packet data communication system according to claim 1, wherein said allocating a proportion of a total number of data packets is performed by using rate allocating service disciplines.
5. The method of processing queued data packets in a packet data communication system according to claim 1, the method further comprising:
providing a packet data user with an identification code to assist in the tier allocation, wherein, the identification code provides at least one of the group consisting of: an identifier for the user and an indication of a number of data packets that the user wishes to transfer.', 'providing a packet data user with an identification code to assist in the tier allocation, wherein, the identification code provides at least one of the group consisting of: an identifier for the user and an indication of a number of data packets that the user wishes to transfer.
6. The method of processing queued data packets in a packet data communication system according to claim 5, the method further comprising:
determining, for each respective tier, that a number of data packets are requested to be processed; and
allocating a proportion of said communication resource to each tier in response to said determination.', 'determining, for each respective tier, that a number of data packets are requested to be processed; and', 'allocating a proportion of said communication resource to each tier in response to said determination.
7. The method of processing queued data packets in a packet data communication system according to claim 1, the method further comprising:
placing a user at a tail of an allocated queue, depending on the userts tier of service when said user provides data packets for queuing.', 'placing a user at a tail of an allocated queue, depending on the userts tier of service when said user provides data packets for queuing.', "8. The method of processing queued data packets in a packet data communication system according to claim 1, the method further comprising:
allocating data packets to a user at a head of the tier queue;
moving said user at said head of the tier queue to the tail of the queue when the user's data packets have been sent; and
moving other users in the queue closer to the head of the queue.", 'allocating data packets to a user at a head of the tier queue;', "moving said user at said head of the tier queue to the tail of the queue when the user's data packets have been sent; and", 'moving other users in the queue closer to the head of the queue.
9. The method of processing queued data packets in a packet data communication system according to claim 8, the method further comprising:
repeating the method of claim 8 until the total number of packets allocated to the tier is transferred.', 'repeating the method of claim 8 until the total number of packets allocated to the tier is transferred
10. The method of processing queued data packets in a packet data communication system according to claim 1, the method further comprising:
determining a tier of service for each user when a packet data session for each user commences.', 'determining a tier of service for each user when a packet data session for each user commences
11. A packet data scheduler queuing data packets in a packet data communication system, the packet data scheduler comprising:
means for allocating a tier of service for each of a plurality of individual packet data queues, wherein the means for allocating allocates different weights to each tier of service based on a number of users requiring access to the available communication resource;
means for determining a total number of data packets that can use an available communication resource;
means, operably coupled to the aforementioned means, for allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource; and
scheduling means to provide said communication resource to queued packet data users on a tier-by-tier basis, such that said resource is made available to all tiers.', 'means for allocating a tier of service for each of a plurality of individual packet data queues, wherein the means for allocating allocates different weights to each tier of service based on a number of users requiring access to the available communication resource;', 'means for determining a total number of data packets that can use an available communication resource;', 'means, operably coupled to the aforementioned means, for allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resource; and', 'scheduling means to provide said communication resource to queued packet data users on a tier-by-tier basis, such that said resource is made available to all tiers
12. The packet data scheduler according to claim 11, wherein said means for allocating a proportion of a total number of data packets provides a commitment that a proportion of an entire communication system bandwidth is allocated to users operating on a particular tier
13. The packet data scheduler according to claim 11, wherein said means for allocating different weights to each tier of service is operable for providing a differential level of service in the allocation of said communication resource between said tiers
14. The packet data scheduler according to claim 11, wherein said means for allocating a proportion of a total number of data packets allocates data packets using rate allocating service disciplines.15. The packet data scheduler according to claim 11, wherein said means for allocating a proportion of a total number of data packets provides a packet data user with an identification code to assist in the tier allocation step, wherein the identification code provides at least one of the group consisting of: an identifier for the user and an indication of a number of data packets that the user wishes to transfer.16. The packet data scheduler according to claim 15, wherein saidmeans for allocating a proportion of a total number of data packets determines, for each respective tier, that a number of data packets are requested to be processed; and allocates a proportion of said communication resource to each tier in response to said determination.', "17. The packet data scheduler according to claim 11, wherein said scheduling means is operable for placing a user at a tail of the allocated queue, depending on the user's tier of service in response to the user providing data packets for queuing.", "18. The packet data scheduler according to claim 11, wherein said scheduling means is operable for:
allocating data packets to a user at a head of the tier queue;
moving said user at said head of the tier queue to the tail of the queue when the user's data packets have been sent; and
moving other user's in the queue closer to the head of the queue.", 'allocating data packets to a user at a head of the tier queue;', "moving said user at said head of the tier queue to the tail of the queue when the user's data packets have been sent; and", "moving other user's in the queue closer to the head of the queue.", '19. The packet data scheduler according to claim 18, wherein said scheduling means repeats the operation of moving data packets and allocating data packets to a head of a tier queue until the total number of packets allocated to the tier has been transferred.
20. A communication unit comprising the packet data scheduler of claim 11.
21. The communication unit according to claim 20, wherein said communication unit operates as a gateway to and/or from two packet data networks.
22. The communication unit of claim 20, wherein said communication unit is a radio network controller for operation in a third Generation Partnership Project (3GPP) specification for wide-band code-division multiple access (WCDMA) communication system.
23. A packet data communication system comprising the packet data scheduler of claim 11.
24. A packet data communication system operable for processing queued data packets, the system comprising:
a packet data scheduler, the packet data scheduler comprising:
logic for allocating a tier of service for each of a plurality of individual packet data queues, wherein the means for allocating allocates different weights to each tier of service based on a number of users requiring access to the available communication resource;
logic for determining a total number of data packets that can use an available communication resource;
logic, operably coupled to the aforementioned means, for allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resources; and
scheduling logic for providing said communication resource to queued packet data users on a tier-by-tier, such that said resource is made available to all tiers.', 'a packet data scheduler, the packet data scheduler comprising:', 'logic for allocating a tier of service for each of a plurality of individual packet data queues, wherein the means for allocating allocates different weights to each tier of service based on a number of users requiring access to the available communication resource;', 'logic for determining a total number of data packets that can use an available communication resource;', 'logic, operably coupled to the aforementioned means, for allocating a proportion of said total number of data packets to a number of the tiers of service to allow individual packet data queues on a number of tiers to share a communication resources; and', 'scheduling logic for providing said communication resource to queued packet data users on a tier-by-tier, such that said resource is made available to all tiers.
25. A computer-readable medium comprising computer executable instructions for performing the method of claim 1.']
View
Licensor Claim Chart
 Claim Chart |
 Technology |
 Creation Date |
 Download |
|---|---|---|---|
|
Claim charts will soon be available!
|
|||
SUMMARY
ClaimChart-US7385994B2-STO
Patent number:US7385994B2
Claim Chart Type : SEP Claim Chart
Price: 200 €
Note:
The information in blue was extracted from the third parties (Standard Setting Organisation, Espacenet)
The information in grey was provided by the patent holder
The information in purple was extracted from the FrandAvenue
Explicitly disclosed patent:openly and comprehensibly describes all details of the invention in the patent document.
Implicitly disclosed patent:does not explicitly state certain aspects of the invention, but still allows for these to be inferred from the information provided.
Basis patent:The core patent in a family, outlining the fundamental invention from which related patents or applications originate.
Family member:related patents or applications that share a common priority or original filing.