Scheduling a mix of best effort (BE) and delay QoS flows
AssigneeQUALCOMM Incorporated
InventorsRitesh K. Madan, Arnab Das, Sundeep Rangan, Siddharth Ray
Life of this patent
Estimating the term…
Abstract
Systems and methodologies are described that facilitate dynamically adjusting scheduling priorities in relation to a combination of delay sensitive flows with delay requirements and best effort flows. The systems and methodologies provide optimal and efficient techniques to enable real time adjustment and assignment of bandwidth for a combination of best effort flows and delay sensitive flows. In particular, the bandwidth allocation is adjusted for each data packet such that delay requirements are met and the remaining bandwidth can be assigned to best effort flows.
Claims36
A method that facilitates scheduling a best effort flow and a flow with a delay requirement within a wireless communications environment, comprising:
- receiving a delay sensitive flow with a delay requirement;
- receiving a best effort flow;
- allocating a first portion of bandwidth to the delay sensitive flow;
- allocating a second portion of bandwidth to the best effort flow;
- reallocating the first portion of bandwidth to a reduced level of bandwidth and the second portion of bandwidth to an increased level of bandwidth if the delay requirement is met;
- reallocating the first portion of bandwidth to an increased level of bandwidth and the second portion of bandwidth to a reduced level of bandwidth if the delay requirement is not met;
- and
- maintaining a level of bandwidth for the first portion of bandwidth and the second portion of bandwidth if the delay requirement is equivalent to the first portion of bandwidth;
- and
- wherein the reallocation of bandwidth for the first portion of bandwidth is served by Wfi(gi(t), di(t), Kji (t)), where fi is a delay sensitive flow, W is a relative weight between priorities of best effort users and priority of delay sensitive flow users, j is a sub-band index, di(t) is a head-of-line delay for a flow, the qi(t) is a buffer size, and the Kji (t) is a spectral efficiency for a flow i at a time t.
A wireless communications apparatus, comprising:
- at least one processor configured to:
- receive a delay requirement associated with a delay sensitive flow;
- receive a best effort flow;
- allocate a first portion of bandwidth to the delay sensitive flow;
- allocate a second portion of bandwidth to the best effort flow;
- reallocate the first portion of bandwidth to a reduced level of bandwidth and the second portion of bandwidth to an increased level if the delay requirement is met;
- reallocate the first portion of bandwidth to an increased level of bandwidth and the second portion of bandwidth to a reduced level of bandwidth if the delay requirement is not met;
- maintain a level of bandwidth for the first portion of bandwidth and the second portion of bandwidth if the delay requirement is equivalent to the first portion of bandwidth;
- wherein the reallocation of bandwidth for the first portion of bandwidth is served by Wfi(qi(t), di(t), Kij(t)), where fi is a delay sensitive flow, W is a relative weight between priorities of best effort users and priority of delay sensitive flow users, j is a sub-band index, di(t) is a head-of-line delay for a flow, the qi(t) is a buffer size, and the Kij(t) is a spectral efficiency for a flow i at a time t;
- and
- a memory coupled to the at least one processor.
A wireless communications apparatus that enables scheduling a best effort flow and a flow with a delay requirement in a wireless communication network, comprising:
- means for receiving a delay requirement associated with a delay sensitive flow;
- means for receiving a best effort flow;
- means for allocating a first portion of bandwidth to the delay sensitive flow;
- means for allocating a second portion of bandwidth to the best effort flow;
- means for reallocating the first portion of bandwidth to a reduced level of bandwidth and the second portion of bandwidth to an increased level if the delay requirement is met;
- means for reallocating the first portion of bandwidth to an increased level of bandwidth and the second portion of bandwidth to a reduced level of bandwidth if the delay requirement is not met;
- means for maintaining a level of bandwidth for the first portion of bandwidth and the second portion of bandwidth if the delay requirement is equivalent to the first portion of bandwidth;
- and
- wherein the reallocation of bandwidth for the first portion of bandwidth is served by Wfi(qi(t), di(t), Kij(t)), where fi is a delay sensitive flow, W is a relative weight between priorities of best effort users and priority of delay sensitive flow users, j is a sub-band index, di(t) is a head-of-line delay for a flow, the qi(t) is a buffer size, and the Kij(t) is a spectral efficiency for a flow i at a time t.
A computer program product, comprising:
- a non-transitory computer-readable medium comprising:
- code for causing at least one computer to receive a delay sensitive flow with a delay requirement;
- code for causing at least one computer to receive a best effort flow;
- code for causing the at least one computer to allocate a first portion of bandwidth to the delay sensitive flow;
- code for causing the at least one computer to allocate a second portion of bandwidth to the best effort flow;
- code for causing the at least one computer to reallocate the first portion of bandwidth to a reduced level of bandwidth and the second portion of bandwidth to an increased level of bandwidth if the delay requirement is met;
- code for causing the at least one computer to reallocate the first portion of bandwidth to an increased level of bandwidth and the second portion of bandwidth to a reduced level of bandwidth if the delay requirement is not met;
- and
- code for causing the at least one computer to maintain a level of bandwidth for the first portion of bandwidth and the second portion of bandwidth if the delay requirement is equivalent to the first portion of bandwidth;
- wherein the reallocation of bandwidth for the first portion of bandwidth is served by Wfi(qi(t), di(t), di(t), Kij (t)), where fi is a delay sensitive flow, W is a relative weight between priorities of best effort users and priority of delay sensitive flow users, i is a sub-band index, di(t) is a head-of-line delay for a flow, the qi(t) is a buffer size, and the Kij(t) is a spectral efficiency for a flow i at a time t.
Dependencies are inferred from the claim text.