TY - GEN
T1 - Packet scheduling and resource allocation for downlink multicarrier systems with quality-of-service constraints
AU - Bai, Qing
AU - Yao Hao, Hao
AU - Nossek, Josef A.
PY - 2011
Y1 - 2011
N2 - We consider the scheduling and resource allocation problem in the downlink of multicarrier systems where data is processed and transmitted in unit of packets. This involves the allocation of transmit power as well as time and frequency slots to packets generated by different service flows, which consequently have various lengths and allows for various latency time in delivery. An optimization to maximize system throughput under frequency division multiple access (FDMA) and available resources restrictions is formulated, and an interactive scheduling and resource allocation approach is proposed to solve this combinatorial-natured problem. The paper especially focuses on the design of packet scheduling algorithms and introduces the concept of virtual packet size and anxious scheduler, which allows for simple implementation and high flexibility. Simulation results show the efficient collaboration of the proposed scheduling algorithm with the resource allocation scheme, and the effectiveness of the system as a whole which favorably exhibits low complexity.
AB - We consider the scheduling and resource allocation problem in the downlink of multicarrier systems where data is processed and transmitted in unit of packets. This involves the allocation of transmit power as well as time and frequency slots to packets generated by different service flows, which consequently have various lengths and allows for various latency time in delivery. An optimization to maximize system throughput under frequency division multiple access (FDMA) and available resources restrictions is formulated, and an interactive scheduling and resource allocation approach is proposed to solve this combinatorial-natured problem. The paper especially focuses on the design of packet scheduling algorithms and introduces the concept of virtual packet size and anxious scheduler, which allows for simple implementation and high flexibility. Simulation results show the efficient collaboration of the proposed scheduling algorithm with the resource allocation scheme, and the effectiveness of the system as a whole which favorably exhibits low complexity.
UR - http://www.scopus.com/inward/record.url?scp=84856441348&partnerID=8YFLogxK
U2 - 10.1109/IWCLD.2011.6123082
DO - 10.1109/IWCLD.2011.6123082
M3 - Conference contribution
AN - SCOPUS:84856441348
SN - 9781457715686
T3 - 2011 3rd International Workshop on Cross Layer Design, IWCLD 2011
BT - 2011 3rd International Workshop on Cross Layer Design, IWCLD 2011
T2 - 2011 3rd International Workshop on Cross Layer Design, IWCLD 2011
Y2 - 30 November 2011 through 1 December 2011
ER -