Queues. A course in queueing theory
The present book consists of 221 pages organized in 12 chapters dealing with queueing theory (the mathematical theory of waiting lines in all its configurations) which can be considered as a standard major area of operations research on the stochastic side. Therefore, universities with an active program in operations research sometimes will have an entire course devoted mainly or entirely to queueing theory, and the course is also taught in computer science, electrical engineering, mathematics, and industrial engineering programs. This text evolved from the author's preferred syllabus for teaching the course, presenting the material in a more logical order than other texts and so being more effective in teaching the basics of queueing theory. It is well-organized easy to follow I am sure the student will like it. The first three chapters focus on the needed preliminaries, including exposition distributions, Poisson processes and generating functions, renewal theory, and Markov chains, Then, rather than switching to first-come first-served memoryless queues here as most texts do, the author discusses the M/G/\(1\) model instead of the M/M/\(1\), and then covers priority queues. Later chapters cover the G/M/\(1\) model, thirteen examples of continuous-time Markov processes, open networks of memoryless queues and closed networks, queueing regimes with insensitive parameters, and then concludes with two-dimensional queueing models which are quasi birth and death processes. Each chapter ends with exercises. In my opinion the author did a good job, but the treated material is a collection of standard results. The book is recommended for BSc and MSc students but not for researchers.
applications in computers science and operations research
scientific article; zbMATH DE number 6154612