Analytical Comparison of Three Packet Scheduling Schemes under a Per-User Minimum Throughput Assurance Requirement in HSDPA

Conference: PIMRC 2005 - 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications
09/11/2005 - 09/14/2005 at Berlin, Germany

Proceedings: PIMRC 2005

Pages: 5Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Seo, Young Ik; Sung, Dan Keun (Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and Technology, Daejeon, 305-701, Korea)

This paper analytically compares three packet scheduling schemes: round robin (RR), proportional fair (PF), and generalized processor sharing (GPS), under a per-user minimum throughput assurance requirement in the HSDPA system. The results show that the PF scheme yields the highest system throughput and the worst case user throughput is also bigger than for other schemes. Moreover, we also investigate the acceptable number of users when the minimum throughput requirement for all users in cell is fixed.