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

N Nasser; B Al-Manthari; H Hassanein

Back

Conference proceeding

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

N Nasser, B Al-Manthari and H Hassanein

CONFERENCE PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, pp.437-441

IEEE International Performance Computing and Communications Conference (IPCCC)

01/01/2005

Abstract

Computer Science

Computer Science, Theory & Methods

Science & Technology

Technology

Telecommunications

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.

Metrics

1 Record Views

Details

Title: A performance comparison of class-based scheduling algorithms in future UNITS access
Creators - without role: N Nasser
B Al-Manthari
H Hassanein
Contributors - without role: T Dahlberg
R Oliver
A Sen
G Xue
Publication Details: CONFERENCE PROCEEDINGS OF THE 2005 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, pp.437-441
Series: IEEE International Performance Computing and Communications Conference (IPCCC)
Publisher: IEEE
Number of pages: 5
Identifiers: 9913220008331
Academic Unit: Alfaisal University
Language: English
Resource Type: Conference proceeding