Paper Info
Title
A playout-buffer-sensitive time slot scheduling for integration of real-time and elastic traffic in wireless networks
Abstract
Some channel-sensitive scheduling algorithms for mobile packet systems are designed to support real-time traffic. They schedule time slots depending on the channel state and queue length in the base station. Although queue length is correlated with the QoS of real-time applications, the essential performance measure of real-time applications is the playout buffer starvation probability. This study proposes a new scheduling algorithm, the playout-buffer-sensitive (PB) rule, which can efficiently support a mixture of real-time and elastic traffic. The PB rule achieves sufficient QoS for the real-time class as well as allocating higher throughput for the best effort class than the existing algorithms. We numerically show that the efficiency of the PB rule is much closer to the theoretical upper bound than the other algorithms.
Year
DOI
Venue
2004
10.1109/PIMRC.2004.1373886
Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium
Keywords
Field
DocType
mobile radio,packet radio networks,probability,quality of service,queueing theory,scheduling,telecommunication traffic,QoS,best effort traffic,channel state,channel-sensitive scheduling algorithm,elastic traffic,mobile packet system,playout buffer starvation probability,playout-buffer-sensitive time slot scheduling,quality of service,queue length,real-time traffic,wireless network
Base station,Wireless network,Computer science,Scheduling (computing),Queue,Network packet,Computer network,Quality of service,Real-time computing,Queueing theory,Throughput
Conference
Volume
ISBN
Citations 
2
0-7803-8523-3
2
PageRank 
References 
Authors
0.43
3
3
Name
Order
Citations
PageRank
Masaki Fukushima1276.13
Hajime Nakamura2193.85
Shinichi Nomoto3418.66