Performance Analysis of Priority Queueing Systems in Discrete Time

The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and...

Full description

Saved in:
Bibliographic Details
Published inNetwork Performance Engineering pp. 203 - 232
Main Authors Walraevens, Joris, Fiems, Dieter, Bruneel, Herwig
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
Packet Delay
Priority Queue
Priority Schedule
Service Time
System Content
Online AccessGet full text

Cover

More Information
Summary:The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes.
ISBN:3642027415
9783642027413
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-02742-0_10