Discrete-time queueing models with priorities

This PhD-dissertation contains analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system contents and packet delays of both classes. The results are applicable in heterogeneous telecommunication networks, when delay-sensitive traffic gets transmission priority over best-effort traffic. Our results predict the influence of priority scheduling on the QoS (Quality-of-Service) of the different types of traffic.

Author dc:creator

• Walraevens, Joris

Contributors dc:contributor

• Bruneel, Herwig

Statement dc:rights

• info:eu-repo/semantics/openAccess

Language dc:language

eng

Identifier

https://biblio.ugent.be/publication/513798
https://biblio.ugent.be/publication/513798/file/1876532

OAI identifier oai:identifier

oai:archive.ugent.be:513798