Waiting time analysis for the generalized PEDF and HOLPRO algorithms in a system with heterogeneous traffic

Author

Varsou, Aikaterini C. ; Poor, H. Vincent

Author_Institution

Dept. of Electr. Eng., Princeton Univ., NJ, USA

Volume

3

fYear

2001

fDate

2001

Firstpage

2152

Abstract

The Powered Earliest Deadline First (PEDF) and Head of Line Pseudoprobability assignment (HOLPRO) algorithms for heterogeneous CDMA networks are extended to their generalized versions, GPEDF and GHOLPRO, that have better performance. Furthermore, a priority queue model is shown to be equivalent in terms of delay analysis to the above algorithms. A mathematical analysis is then performed and is shown to provide a relationship between the mean waiting times of different classes of traffic

Keywords

cellular radio; code division multiple access; data communication; delay estimation; queueing theory; scheduling; traffic; GHOLPRO algorithm; GPEDF algorithm; HOLPRO algorithm; Head of Line Pseudoprobability assignment algorithm; PEDF algorithm; Powered Earliest Deadline First algorithm; delay analysis; heterogeneous CDMA networks; heterogeneous traffic; mean waiting times; performance; priority queue model; traffic classes; Algorithm design and analysis; Delay; Downlink; Mathematical analysis; Multiaccess communication; Power system modeling; Queueing analysis; Scheduling; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Vehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd

Conference_Location

Rhodes

ISSN

1090-3038

Print_ISBN

0-7803-6728-6

Type

conf

DOI

10.1109/VETECS.2001.945077

Filename

945077