DMCA
On Average and Worst Case Behaviour in Non-Preemptive Priority Queueing (2003)
Cached
Download Links
| Venue: | In Proceedings of the 2003 Internation Symposium on Performance Evaluation of Computer and Telecommunication Systems |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Schmitt03onaverage,
author = {Jens Schmitt},
title = {On Average and Worst Case Behaviour in Non-Preemptive Priority Queueing},
booktitle = {In Proceedings of the 2003 Internation Symposium on Performance Evaluation of Computer and Telecommunication Systems},
year = {2003},
pages = {pages}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract: In this paper, we derive worst case bounds on delay and backlog for non-preemptive priority queueing systems using network calculus. There are known results for the average behaviour of non-preemptive priority queueing systems from traditional queueing theory. By use of numerical investigations, we compare our worst case bounds to those average behaviour results in order to give a feel as to how conservative the worst case bounds are. A practical application of our results is given for DiffServ-based networks which use simple priority queueing to differentiate several traffic classes by assigning them different delay targets.
Keyphrases
worst case behaviour non-preemptive priority queueing non-preemptive priority worst case diffserv-based network practical application simple priority network calculus case bound average behaviour result different delay target average behaviour several traffic class numerical investigation
