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

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.