Carrier selection policy for joint scheduling for carrier aggregation in an LTE-advanced system
View Patent ↗Various embodiments of a semi-joint scheduling algorithm for carrier aggregation in an LTE-Advanced system are provided. The proposed semi-joint scheduling algorithm combines the advantages of independent scheduling and joint scheduling while avoiding the respective shortcomings, and provides a technical foundation for a wide adoption of the carrier aggregation technology. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
1. A method, comprising:
obtaining buffer status of a plurality of buffers of a plurality of component carrier schedulers, wherein each of the plurality of schedulers independently schedules respective resource blocks to transmit respectively distributed data packets utilizing a corresponding component carrier as part of carrier aggregation in a communication system; and
distributing a flow of a plurality of data packets from a plurality of communication devices among the plurality of buffers of the plurality of component carrier schedulers according to the buffer status of the plurality of buffers,
wherein the buffer status of each of the respective buffers indicates efficiency in distributing respective resource blocks of a respective one of the plurality of component carrier schedulers, and
wherein the distributing is in accordance with the following formula:
B
i
=
R
i
′
+
[
1
-
R
i
′
R
B
]
×
Δ
R
wherein:
Bi represents a flow distribution to be updated on an i th buffer of the plurality of buffers;
R i ′ represents an amount of a remaining flow of data packets on the i th buffer;
RB represents a depth of each of the plurality of buffers;
ΔR represents a basic unit of the distributed flow of data packets; and
0≦ΔR<RB.
2. The method of claim 1 , wherein the distributing comprises:
allocating a first number of data packets to a first buffer of the plurality of buffers and allocating a second number of data packets to a second buffer of the plurality of buffers in response to:
the first number being less than the second number, and
a respective buffer status of the first buffer and a respective buffer status of the second buffer indicating an amount of a remaining flow of data packets on the first buffer is greater than an amount of a remaining flow of data packets on the second buffer.
3. The method of claim 1 , wherein at least one of the component carrier schedulers schedules the respective resource blocks of a respective component carrier according to a respective carrier quality index, a respective power, or a combination thereof.
4. The method of claim 1 , further comprising:
obtaining an updated buffer status of the plurality of buffers at a later time; and
re-distributing the flow of the plurality of data packets from the plurality of communication devices among the plurality of buffers of the plurality of component carrier schedulers according to the updated buffer status of the plurality of buffers.
5. The method of claim 1 , further comprising:
initializing a value of a respective buffer status of at least one of the plurality of buffers before the distributing.
6. An apparatus, comprising:
a memory in which a set of processor-executable instructions is stored; and
a processor coupled to the memory, upon executing the set of processor-executable instructions the processor performing operations comprising:
monitoring a buffer status of a plurality of buffers, each of the plurality of buffers corresponding to a respective one of a plurality of component carrier scheduler, wherein a respective buffer status of the each of the plurality of buffers indicates efficiency in distributing resource blocks of the respective one of a plurality of component carrier schedulers, wherein further each of the component carrier schedulers independently schedules respective resource blocks to transmit respectively distributed data packets utilizing a corresponding component carrier as part of carrier aggregation in a communication system,
distributing a flow of a plurality of data packets from a plurality of communication devices among the plurality of buffers of the plurality of component carrier schedulers according to the buffer status of the plurality of buffers, and
periodically adjusting the flow of the plurality of data packets distributed among the plurality of buffers in response to changes in the monitored buffer status of the plurality of buffers,
wherein the distributing is in accordance with the following formula:
B
i
=
R
i
′
+
[
1
-
R
i
′
R
B
]
×
Δ
R
wherein:
Bi represents a flow distribution to be updated on an i th buffer of the plurality of buffers;
R i ′ represents an amount of a remaining flow of data packets on the i th buffer;
ΔR represents a basic unit of the distributed flow of data packets; and
0≦ΔR<RB.
7. The apparatus of claim 6 , wherein the distributing comprises:
allocating a first number of data packets to a first buffer of the plurality of buffers and allocating a second number of data packets to a second buffer of the plurality of buffers in response to:
the first number being less than the second number, and a respective buffer status of the first buffer and respective buffer status of the second buffer indicating an amount of a remaining flow of data packets on the first buffer is greater than an amount of a remaining flow of data packets on the second buffer.
8. The apparatus of claim 6 , wherein upon executing the set of processor-executable instructions the processor further performs operations comprising:
initializing a value of a respective buffer status of at least one of the plurality of buffers before the distributing.
9. A non-transitory computer-readable medium storing instructions that, when executed, cause one or more processors to perform operations comprising:
obtaining, at a first point in time, first buffer status of a plurality of buffers of a plurality of component carrier schedulers, wherein each of the plurality of schedulers independently schedules respective resource blocks to transmit respectively distributed data packets utilizing a corresponding component carrier as part of carrier aggregation in a communication system;
obtaining, at a second point in time after the first point in time, second buffer status of the plurality of buffers of the plurality of component carrier schedulers; and
adjusting a distribution of a flow of a plurality of data packets from a plurality of communication devices among the plurality of buffers of the plurality of component carrier schedulers in response to a difference between the first buffer status and the second buffer status of the plurality of buffers,
wherein the distribution of the flow of the plurality of data packets is in accordance with the following formula:
B
i
=
R
i
′
+
[
1
-
R
i
′
R
B
]
×
Δ
R
wherein:
Bi represents a flow distribution to be updated on an i th buffer of the plurality of buffers;
R i ′ represents an amount of the remaining flow of data packets on the i th buffer;
RB represents a depth of each of the plurality of buffers;
ΔR represents a basic unit of the distributed flow of data packets; and
0≦ΔR<RB.
10. The computer-readable medium of claim 9 , wherein the adjusting the distribution comprises:
allocating a first number of data packets to a first buffer of the plurality of buffers and allocating a second number of data packets to a second buffer of the plurality of buffers in response to:
the first number being less than the second number, and
a respective buffer status of the first buffer and a respective buffer status of the second buffer indicating an amount of a remaining flow of data packets on the first buffer is greater than an amount of a remaining flow of data packets on the second buffer.
11. The computer-readable medium of claim 9 , wherein the operations further comprise:
initializing a value of a respective buffer status of at least one of the plurality of buffers before the distribution of the flow of the plurality of data packets.