By Topic

A performance comparison of class-based scheduling algorithms in future UMTS access

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nasser, N. ; Dept. of Comput. & Inf. Sci., Univ. of Guelph, Ont., Canada ; Al-Manthari, B. ; Hassanein, H.

The 3G UMTS is currently undergoing inherent changes. The expected release 5&6 of UMTS will contain a new set of features known collectively as high speed downlink packet access (HSDPA). In this paper, we propose two packet scheduling algorithms for HSDPA, shortest queue first (SQF) and longest queue first (LQF), to provide priority scheduling between services of different quality of service (QoS) classes and fairness between users within the same class. Simulation results show that the proposed algorithms meet QoS requirements of different traffic classes, with the SQF algorithm having a better performance compared to the LQF algorithm.

Published in:

Performance, Computing, and Communications Conference, 2005. IPCCC 2005. 24th IEEE International

Date of Conference:

7-9 April 2005