This book celebrates the 65th birthday of J. W. Cohen, Professor of Operational Analysis at the Mathematics Department of the University of Utrecht. The contents of the book (see below) provide an introduction to the field of general queueing theory as well as a selection of some special topics which are representative for problems of actual interest in the theory and applications of the queueing systems and networks. The technical part is opened by a survey of recent computer and telecommunication protocols and their performance analysis, resource sharing and system design, always presenting suitable queueing theoretical models (Kleinbrock); Lavenberg gives a historical sketch of the development of analytical methods for system performance analysis stressing on algorithms and approximations obtained from this class of models, especially network models, while Tijms concentrates on numerical computer oriented methods for single node systems (G/G/c); the review on Markov processes and teletraffic concentrates on potential theory, semi- groups and passage times for Markov processes (Syski). In my opinion anyone specialized in one of the four (or any other) fields of queueing theory will find these articles to be a concise but informatory review of a great part of this field.
Contents:
Preface. J. W. Cohen: his scientific career. Scientific publications of J. W. Cohen.
Part I. Surveys. L. Kleinbrock, Performance evaluation of distributed computer-communication systems, S. S. Lavenberg, A perspective on queueing models of computer performance. R. Syski, Markov processes and teletraffic. H. C. Tijms, Computational methods for queueing models: a review.
Part II. The single server queue. J. Abate and W. Whitt, Approximation for the M/M/1 busy-period distribution. E. G. Coffman, jun. and I. Mitrani, Storage of the single-server queue. B. T. Doshi and J. S. Kaufman, Sojourn time in an M/G/1 queue with Bernoulli feedback.
Part III. Analytic methods in queueing theory. J. P. C. Blanc, On the relaxation times of open queueing networks. O. J. Boxma and W. P. Groenendijk, Two queues with alternating service and switching times. G. J. Fayolle and M. A. Brun, On a system with impatience and repeated calls. P. Le Gall, Some comments on the work of J. W. Cohen and new results in the theory of queueing networks.
Part IV. Networks and computers. J. B. M. van Doremalen and J. Wessels, A recursive aggregation-disaggregation method to approximate large scale closed queueing networks with multiple job types. M. Hofri, Reduced state-space heuristics for symmetric Markovian queueing systems. A. Hordijk, Insensitivity, sensitivity and partial insensitivity for some queueing models. F. P. Kelly, The optimization of queueing and loss networks.
Part V. Queueing models and related topics. J. Gani, A note on the random walk for the transport and deposition of particles. C. C. Heyde, Asymptotic efficiency results for the method of moments with application to estimation for queueing processes. H. Kaspi and M. Rubinovitch, Regenerative sets and their applications to Markov storage systems. M. J. Phelan and N. U. Prabhu, Estimation from an infinite server queueing system with two demands.
Epilogue. A. Jensen, Art and science - the greatness and tragedy of applied science.