7 Chapter: Queueing Networks

In this chapter we first study how variability propagates through tandem networks of \(G/G/c\) queues in Section 7.1. We then explore deterministic queueing networks in Section 7.2, which, despite their simplicity, already pose interesting challenges. Next, we analyze open networks of \(M/M/c\) stations in Section 7.3. The analysis of such networks involves an equation of the type \(\lambda = \gamma + \lambda P,\) where \(\lambda\) and \(\gamma\) are row vectors and \(P\) is a substochastic matrix.1A substochastic matrix is a nonnegative matrix whose row sums are less than or equal to \(1.\) For the open networks considered here, we also require all eigenvalues to have modulus less than \(1.\) In Section 7.4, we concentrate on the solution of this equation. Finally, Section 7.5 analyzes closed queueing networks using mean value analysis.

We point out that the techniques developed in this chapter extend (way) beyond just queueing theory; they are worth memorizing. Thus, while this chapter closes our journey through the study of queueing systems, it is a first step toward a much longer journey into the diverse applications of probability theory. For further reading, we recommend the following books.