Fair and efficient packet scheduling algorithms for multiple classes of service under QoS guarantee in UMTS

Authors:
MinXiou Chen;Ren-Hung Hwang
Affiliations:
Department of Computer Science and Information Engineering, National Chungcheng University, 160 San-Hsing, Ming-Hsiung, Chiayi 621, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Chungcheng University, 160 San-Hsing, Ming-Hsiung, Chiayi 621, Taiwan, R.O.C.
Venue:
Computer Communications
Year:
2005

Citing 14
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level

IEEE/ACM Transactions on Networking (TON)
A reliable and scalable striping protocol

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking (TON)
Adapting packet fair queueing algorithms to wireless networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Self-Similar Network Traffic and Performance Evaluation

Self-Similar Network Traffic and Performance Evaluation
Dynamic bandwidth allocation for multimedia traffic with rate guarantee and fair access in WCDMA systems

MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks

IEEE Communications Magazine
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users

IEEE Communications Magazine
Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

IEEE Journal on Selected Areas in Communications

Criminal investigation and forensic tools for smartphones

International Journal of Electronic Security and Digital Forensics

Quantified Score

Hi-index	0.24

Visualization

Abstract

Packet scheduling is the essential technique to provide QoS for multiple classes of service. Provided a minimum amount of bandwidth guarantee and a fair shared of residual bandwidth under a certain amount of power are the two major objectives of the packet scheduling in 3G networks. This paper presents two scheduling algorithms, MWF^2Q+ and MDRR, for multiple classes of service in the forward link of the UMTS network. These scheduling algorithms can allocate bandwidth in proportion to weights of flows sharing the channel under a certain amount of transmission power, and assign OVSF code to backlogged flows on a frame-by-frame basis. The MWF^2Q+ algorithm has better fairness properties while the MDRR algorithm requires less computational complexity. The efficiency and fairness properties are verified by our performance analysis. Our simulation results show that these two algorithms support multiple traffic sources with heterogeneous rate guarantees while fully utilizing the system bandwidth. The impact of self-similar traffic is also addressed in our simulations.