Queueing theory is an intricate and yet highly practical field of mathematical study that has vast applications in performance evaluation. This second edition of the book enhances the contents of the first edition. It is an introductory text on queueing modeling techniques and applications of data networks, examining the underlying principles of isolated queueing systems.

The book is organized into nine chapters. Chapter 1 highlights some important results that are crucial to the subsequent treatment of queueing systems. The next chapter discusses basic elements of queueing theory and properties of a Poisson process. Markov processes are covered in chapter 3, followed by a discussion of a single-server Markovian queue and its applications in chapter 4. Chapter 5 looks at semi-Markovian systems and their variants. Chapter 6 presents applications to the open queueing networks, while chapter 7 presents applications to the closed queueing networks. Chapter 8 deals with Markov-modulated arrivals, and introduces network calculus that enables deterministic bounds to be derived. Chapter 9 applies the queueing models to study the performance of flow control in communication networks. Emphasis is placed on the techniques used to derive the performance measures for those models that are widely used in computer communications and networking. Several buffer allocation schemes are studied using Markovian systems that combat congested states.

This book introduces complex queueing models in a simple language, without using sophisticated mathematical tools. The book incorporates a rich set of examples in its applications to communication networks, and a set of exercises at the end of each chapter facilitates the use of the book for teaching. The book would serve ideally as a text for an undergraduate course on network performance analysis.