Open Access
Translator Disclaimer
November 2001 Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions
Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis
Ann. Appl. Probab. 11(4): 1384-1428 (November 2001). DOI: 10.1214/aoap/1015345407

Abstract

We study the distribution of steady-state queue lengths in multiclass queueing networks under a stable policy. We propose a general methodology based on Lyapunov functions for the performance analysis of infinite state Markov chains and apply it specifically to Markovian multiclass queueing networks. We establish a deeper connection between stability and performance of such networks by showing that if there exist linear or piecewise linear Lyapunov functions that show stability, then these Lyapunov functions can be used to establish geometric-type lower and upper bounds on the tail probabilities, and thus bounds on the expectation of the queue lengths. As an example of our results, for a reentrant line queueing network with two processing stations operating under a work-conserving policy, we show that $\mathrm{E}[L] = O(\frac{1}{1 - \rho^*)^2})$, where $L$ is the total number of customers in the system, and $\rho^*$ is the maximal actual or virtual traffic intensity in the network. In a Markovian setting, this extends a recent result by Dai and Vande Vate, which states that a reentrant line queueing network with two stations is globally stable if $\rho^*<1$. We also present several results on the performance of multiclass queueing networks operating under general Markovian and,in particular,priority policies. The results in this paper are the first that establish explicit geometric-type upper and lower bounds on tail probabilities of queue lengths for networks of such generality. Previous results provide numerical bounds and only on the expectation, not the distribution, of queue lengths.

Citation

Download Citation

Dimitris Bertsimas. David Gamarnik. John N. Tsitsiklis. "Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions." Ann. Appl. Probab. 11 (4) 1384 - 1428, November 2001. https://doi.org/10.1214/aoap/1015345407

Information

Published: November 2001
First available in Project Euclid: 5 March 2002

zbMATH: 1012.60082
MathSciNet: MR1878302
Digital Object Identifier: 10.1214/aoap/1015345407

Subjects:
Primary: 60K20

Keywords: bounds , Lyapunov functions , networks , Queueing

Rights: Copyright © 2001 Institute of Mathematical Statistics

JOURNAL ARTICLE
45 PAGES


SHARE
Vol.11 • No. 4 • November 2001
Back to Top