zbMATH — the first resource for mathematics

Queueing systems: Problems and solutions. (English) Zbl 0870.60091
Wiley-Interscience Publication. New York, NY: John Wiley & Sons. xii, 227 p. (1996).
This text is centered around exercises and examples from the book by the first author [“Queueing systems. Vol. I: Theory” (1975; Zbl 0334.60045)]. It starts with a short queueing theory primer and then leads directly to problems with solutions (or at least: hints to the solutions). The range of the problems is between elementary exercises and (for the beginner) hard theorems. These are divided into six sections: 1. Random processes, 2. Birth-death queueing systems, 3. Markovian queues, 4. The queue M/G/1, 5. The queue G/M/m, 6. The queue G/G/1. The decision of not dealing with networks of queues (except some fundamental networks of Markovian queues) may be reasonable in a first course and a guide for self-study – but it excludes the possibly most fascinating part of modern queueing theory.
The text is written in a concise and clear manner for an audience from the computer science and OR departments. This results at some places in omission of details in the mathematical framework. I would recommend the text as a companion to a more detailed text for a queueing theory course. In this connection the exercises and solutions will be valuable. As Kleinrock’s textbook was very successful and influential in the computer communication society and the present text is exactly in the spirit and style of that book, it can be expected to be successful as well.
Reviewer: H.Daduna (Hamburg)

60K25 Queueing theory (aspects of probability theory)
60-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to probability theory
90B22 Queues and service in operations research
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems