Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
type: Item
instance of: scholarly article
title: Stability of queueing networks. École d'Été de probabilités de Saint-Flour XXXVI-2006
zbMATH Open document ID: 1152.60004
DOI: 10.1007/978-3-540-68896-9
author: Maury Bramson
published in: Lecture Notes in Mathematics
publication date: 2008-06-25T00:00:00Z
review text: This book deals with the issue of the queueing network stability. We recall that a queueing network is stable when its underlying Markov process of the queueing network is a positive Harris recurrent. Intuitively, a natural condition for stability (assuming all states communicate), is that \(\rho_{i} < 1\) for all stations \(i\). The material of the book is divided into three parts. The first (Chapter 2) discusses the ``classical'' queueing networks introduced in the BCMP model including networks with FIFO, PS and LIFO disciplines. For \(\rho_{i} < 1\) for all stations \(i\), these networks are stable, and explicit product-like formulas are given for their stationary distributions. The second part (Chapter 3) of this book presents the best known examples of unstable subcritical queueing networks in a more-or-less chronological order. To these examples belongs, among others, the so-called \textit{adversarial queueing system}, where an all-knowledgeable adversary is allowed to modify the precise timing of input into the system. Service times are deterministic and are often assumed to be the same everywhere. The third part (Chapters 4 and 5) gives general and sufficient conditions for the stability of a queueing network. The main results of this part show that the queueing network is stable whenever an associated fluid model is stable. Applications of such stability are given in Sections 5.1 - 5.3. In each presented case, the procedure to demonstrate the stability of a related fluid model is given. In the remaining of this the global stability problem is discussed. Applying the given theorem, a queueing network will be globally stable if its fluid model exists. For a two-station fluid model with deterministic routing a complete theory of stability is given. Moreover, the basic fluid model is employed to demonstrate the global rate stability, often called globally weak stability. This book, including the material from a series of nine lectures given at the Saint-Flour-P…
reviewed by: Jerzy Martyna
Mathematics Subject Classification ID: 60-02
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5292601
zbMATH Keywords: queueing theory
zbMATH Keywords: performance evaluation
zbMATH Keywords: queueing
zbMATH Keywords: queues and service
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/978-3-540-68896-9
OpenAlex ID: W2171625164
Recommended article: Q4725464
Recommended article: Stability and probability. I: Convergence for queueing networks via Lyapunov optimization
Recommended article: Stability of queueing networks
Recommended article: Stability, queue length, and delay of deterministic and stochastic queueing networks
Recommended article: Stability of two families of queueing networks and a discussion of fluid limits
Recommended article: Instability in stochastic and fluid queueing networks
Recommended article: Q4518639
Recommended article: Stability of earliest-due-date, first-served queueing networks
description: scientific article; zbMATH DE number 5292601