Performance analysis of priority queueing systems in discrete time

  • Authors:
  • Joris Walraevens;Dieter Fiems;Herwig Bruneel

  • Affiliations:
  • Department for Telecommunications and Information Processing, Ghent University, Gent, Belgium;Department for Telecommunications and Information Processing, Ghent University, Gent, Belgium;Department for Telecommunications and Information Processing, Ghent University, Gent, Belgium

  • Venue:
  • Network performance engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.