摘要:
A method and arrangement for fair control of resources amongst users with different instantaneous throughputs in a radio communication system such as a UMTS system. Respective indications of users among whom resources are to be allocated are placed in a 'round robin' queue (200) and each user whose indication is at the head of the queue is allocated a number of resource units as a function (300) of: β, a predetermined parameter determining the extent to which a fixed number of resource units should be allocated to the user and the extent to which a fixed volume of data should be transferred from/to the user; ζ, the volume of data that the user is allowed to transfer if β=1; λ, the number of resource units that can be allocated if β=0; and θ, the number of information bits per resource unit that can be transferred to/from the user. This provides the following advantages: the resources can be allocated in the manner chosen by the operator; the function requires very few input parameters, and so is simple to operate.
摘要:
A method of processing queued data packets in a packet data communication system 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. Such a technique is considerably easier to implement, it allows better control of resources when throughput rates vary on a per user basis. It is also more applicable when the when the number of allocated resource units per round is small compared to the total number of clients requiring service. Furthermore, the technique reduces the amount of processing required to transfer a number of data packets and is more flexible to changes in the overall number of users served changes.
摘要:
A method of processing queued data packets in a packet data communication system 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. Such a technique is considerably easier to implement, it allows better control of resources when throughput rates vary on a per user basis. It is also more applicable when the when the number of allocated resource units per round is small compared to the total number of clients requiring service. Furthermore, the technique reduces the amount of processing required to transfer a number of data packets and is more flexible to changes in the overall number of users served changes.
摘要:
A scheme for resource allocation for variable rate users in a packet-based radio communication system such as a UMTS TDD system is based on a representation (200) of the resource space organised orthogonally in 3 dimensions by codes, timeslots and frames. The representation (200) is searched to identify new resources that may be allocated and updated when new resources have been allocated. This scheme provides an efficient method for placing allocated resources into the system resource space while maintaining efficient packing, and provides the following advantages: allocations that result in different overall throughput rates can be made to users; efficient packing of allocated resources means that wasted resources is minimised; since the representation of the system resource space is bounded, the stored information at the resource allocator function (in the radio access network) can be minimized; allocations are only made based on the most current frame in the representation of the system resource space this reduces required complexity; and the maximum number of frames into the future over which resources can be allocated can be used to modify the shape of allocations.
摘要:
A scheme for resource allocation for variable rate users in a packet-based radio communication system such as a UMTS TDD system is based on a representation (200) of the resource space organised orthogonally in 3 dimensions by codes, timeslots and frames. The representation (200) is searched to identify new resources that may be allocated and updated when new resources have been allocated. This scheme provides an efficient method for placing allocated resources into the system resource space while maintaining efficient packing, and provides the following advantages: allocations that result in different overall throughput rates can be made to users; efficient packing of allocated resources means that wasted resources is minimised; since the representation of the system resource space is bounded, the stored information at the resource allocator function (in the radio access network) can be minimized; allocations are only made based on the most current frame in the representation of the system resource space this reduces required complexity; and the maximum number of frames into the future over which resources can be allocated can be used to modify the shape of allocations.
摘要:
A method and arrangement for fair control of resources amongst users with different instantaneous throughputs in a radio communication system such as a UMTS system. Respective indications of users among whom resources are to be allocated are placed in a 'round robin' queue (200) and each user whose indication is at the head of the queue is allocated a number of resource units as a function (300) of: β, a predetermined parameter determining the extent to which a fixed number of resource units should be allocated to the user and the extent to which a fixed volume of data should be transferred from/to the user; ζ, the volume of data that the user is allowed to transfer if β=1; λ, the number of resource units that can be allocated if β=0; and θ, the number of information bits per resource unit that can be transferred to/from the user. This provides the following advantages: the resources can be allocated in the manner chosen by the operator; the function requires very few input parameters, and so is simple to operate.