TY - GEN
T1 - Delay-aware packet scheduling algorithm for multiple traffic classes in 3GPP LTE system
AU - Bae, Sueng Jae
AU - Choi, Bum Gon
AU - Chung, Min Young
PY - 2011
Y1 - 2011
N2 - In wireless mobile environments, large bandwidth and high quality of service (QoS) are recently required to support the increased demand for multimedia services. Long term evolution (LTE) is one of the promising solutions for the next generation broadband wireless access systems. In order to support high data rate with low latency, LTE simplifies network architecture and uses orthogonal frequency division multiple access (OFDMA) for downlink transmission technology. Packet scheduling algorithm is one of the important features to support QoS in LTE system. In this paper, we propose delay-aware packet scheduling (DAPS) algorithm considering QoS requirements of delays for various traffic classes, channel conditions, and fairness. To reflect delay experience at scheduling instance, DAPS algorithm observes how queue waiting time of head-of-line (HOL) packet is closed to allowed maximum packet delay. As a result, DAPS increases the number of transmitted packets with satisfying the required delay. Comprehensive simulation results show that DAPS algorithm yields better delay performance compared with two existing PF and M-LWDF algorithms.
AB - In wireless mobile environments, large bandwidth and high quality of service (QoS) are recently required to support the increased demand for multimedia services. Long term evolution (LTE) is one of the promising solutions for the next generation broadband wireless access systems. In order to support high data rate with low latency, LTE simplifies network architecture and uses orthogonal frequency division multiple access (OFDMA) for downlink transmission technology. Packet scheduling algorithm is one of the important features to support QoS in LTE system. In this paper, we propose delay-aware packet scheduling (DAPS) algorithm considering QoS requirements of delays for various traffic classes, channel conditions, and fairness. To reflect delay experience at scheduling instance, DAPS algorithm observes how queue waiting time of head-of-line (HOL) packet is closed to allowed maximum packet delay. As a result, DAPS increases the number of transmitted packets with satisfying the required delay. Comprehensive simulation results show that DAPS algorithm yields better delay performance compared with two existing PF and M-LWDF algorithms.
UR - https://www.scopus.com/pages/publications/84857880685
U2 - 10.1109/APCC.2011.6152755
DO - 10.1109/APCC.2011.6152755
M3 - Conference contribution
AN - SCOPUS:84857880685
SN - 9781457703881
T3 - 17th Asia-Pacific Conference on Communications, APCC 2011
SP - 33
EP - 37
BT - 17th Asia Pacific Conference on Communications, APCC 2011
T2 - 17th Asia Pacific Conference on Communications, APCC 2011
Y2 - 2 October 2011 through 5 October 2011
ER -
