Asymptotic analysis of Lévy-driven tandem queues

  • Authors:
  • Pascal Lieshout;Michel Mandjes

  • Affiliations:
  • Korteweg-de Vries Institute for Mathematics, Amsterdam, The Netherlands 1018 and CWI, Amsterdam, The Netherlands 1090;Korteweg-de Vries Institute for Mathematics, Amsterdam, The Netherlands 1018 and CWI, Amsterdam, The Netherlands 1090 and Eurandom, Eindhoven, The Netherlands 5600

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

We analyze tail asymptotics of a two-node tandem queue with spectrally-positive Lévy input. A first focus lies in the tail probabilities of the type 驴(Q 1驴 x,Q 2(1驴驴)x), for 驴驴(0,1) and x large, and Q i denoting the steady-state workload in the ith queue. In case of light-tailed input, our analysis heavily uses the joint Laplace transform of the stationary buffer contents of the first and second queue; the logarithmic asymptotics can be expressed as the solution to a convex programming problem. In case of heavy-tailed input we rely on sample-path methods to derive the exact asymptotics. Then we specialize in the tail asymptotics of the downstream queue, again in case of both light-tailed and heavy-tailed Lévy inputs. It is also indicated how the results can be extended to tandem queues with more than two nodes.