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

Aikaterini C. Varsou, H. Vincent Poor

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

In this paper, 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.

Original languageEnglish (US)
Pages (from-to)2152-2156
Number of pages5
JournalIEEE Vehicular Technology Conference
Volume3
Issue number53ND
DOIs
StatePublished - Jan 1 2001

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Waiting time analysis for the generalized PEDF and HOLPRO algorithms in a system with heterogeneous traffic'. Together they form a unique fingerprint.

  • Cite this