TY - GEN
T1 - Packet scheduling algorithm for non-real-time service with soft QoS requirement in mobile broadband wireless access system
AU - Lee, Jeong Hwan
AU - Kim, Sung Kyung
AU - Lee, Seong Choon
AU - Tcha, Yong Joo
AU - Kang, Chung Gu
PY - 2006
Y1 - 2006
N2 - In this paper, a packet scheduling algorithm for non-real-time service is considered, with a soft QoS requirements, which allows for degrading the QoS level, e.g., typically the packet delay, whenever necessary, in mobile broadband wireless internet access systems. This is designed to optimally trade off system throughput and delay performance, depending on soft QoS requirements, as opposed to most existing packet scheduling algorithms for non-real-time service, which are simply designed to maximize the system throughput without a delay constraint in any sense. The proposed adaptive exponential scheduling algorithm intentionally introduces additional delay to some users under bad channel conditions, allowing for serving users only under good channel conditions, as long as the resulting QoS degradation is acceptable for non-real-time service users. The results from system-level simulation demonstrate that the system capacity can be significantly increased, over existing algorithms, by as much as 65%, using the adaptive exponential scheduling algorithm, and satisfying the given QoS level requirements.
AB - In this paper, a packet scheduling algorithm for non-real-time service is considered, with a soft QoS requirements, which allows for degrading the QoS level, e.g., typically the packet delay, whenever necessary, in mobile broadband wireless internet access systems. This is designed to optimally trade off system throughput and delay performance, depending on soft QoS requirements, as opposed to most existing packet scheduling algorithms for non-real-time service, which are simply designed to maximize the system throughput without a delay constraint in any sense. The proposed adaptive exponential scheduling algorithm intentionally introduces additional delay to some users under bad channel conditions, allowing for serving users only under good channel conditions, as long as the resulting QoS degradation is acceptable for non-real-time service users. The results from system-level simulation demonstrate that the system capacity can be significantly increased, over existing algorithms, by as much as 65%, using the adaptive exponential scheduling algorithm, and satisfying the given QoS level requirements.
UR - http://www.scopus.com/inward/record.url?scp=42549158961&partnerID=8YFLogxK
U2 - 10.1109/ICC.2006.255413
DO - 10.1109/ICC.2006.255413
M3 - Conference contribution
AN - SCOPUS:42549158961
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 5240
EP - 5245
BT - 2006 IEEE International Conference on Communications, ICC 2006
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -