On a generic class of two-node queueing systems

  • Authors:
  • Ivo Adan;Michel Mandjes;Werner Scheinhardt;Elena Tzenova

  • Affiliations:
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB and Eurandom, Eindhoven, The Netherlands 5600 MB;Korteweg-de Vries Institute, University of Amsterdam, Amsterdam, The Netherlands 1018 TV and CWI, Amsterdam, The Netherlands and Eurandom, Eindhoven, The Netherlands 5600 MB;CWI, Amsterdam, The Netherlands and Faculty of Electrical Engineering, Mathematics, and Computer Science, University of Twente, Enschede, The Netherlands 7500 AE;Eurandom, Eindhoven, The Netherlands 5600 MB

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper analyzes a generic class of two-node queueing systems. A first queue is fed by an on---off Markov fluid source; the input of a second queue is a function of the state of the Markov fluid source as well, but now also of the first queue being empty or not. This model covers the classical two-node tandem queue and the two-class priority queue as special cases. Relying predominantly on probabilistic argumentation, the steady-state buffer content of both queues is determined (in terms of its Laplace transform). Interpreting the buffer content of the second queue in terms of busy periods of the first queue, the (exact) tail asymptotics of the distribution of the second queue are found. Two regimes can be distinguished: a first in which the state of the first queue (that is, being empty or not) hardly plays a role, and a second in which it explicitly does. This dichotomy can be understood by using large-deviations heuristics.