## Queueing systems: Computer applicationsQueueing Systems Volume 1: Theory Leonard Kleinrock This book presents and develops methods from queueing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field. It provides a long-needed alternative both to highly mathematical texts and to those which are simplistic or limited in approach. Written in mathematical language, it avoids the "theorem-proof" technique: instead, it guides the reader through a step-by-step, intuitively motivated yet precise development leading to a natural discovery of results. Queueing Systems, Volume I covers material ranging from a refresher on transform and probability theory through the treatment of advanced queueing systems. It is divided into four sections: 1) preliminaries; 2) elementary queueing theory; 3) intermediate queueing theory; and 4) advanced material. Important features of Queueing Systems, Volume 1: Theory include- * techniques of duality, collective marks * queueing networks * complete appendix on z-transforms and Laplace transforms * an entire appendix on probability theory, providing the notation and main results needed throughout the text * definition and use of a new and convenient graphical notation for describing the arrival and departure of customers to a queueing system * a Venn diagram classification of many common stochastic processes 1975 (0 471-49110-1) 417 pp. Fundamentals of Queueing Theory Second Edition Donald Gross and Carl M. Harris This graduated, meticulous look at queueing fundamentals developed from the authors' lecture notes presents all aspects of the methodology-including Simple Markovian birth-death queueing models; advanced Markovian models; networks, series, and cyclic queues; models with general arrival or service patterns; bounds, approximations, and numerical techniques; and simulation-in a style suitable to courses of study of widely varying depth and duration. This Second Edition features new expansions and abridgements which enhance pedagogical use: new material on numerical solution techniques for both steady-state and transient solutions; changes in simulation language and new results in statistical analysis; and more. Complete with a solutions manual, here is a comprehensive, rigorous introduction to the basics of the discipline. 1985 (0 471-89067-7) 640 pp. |

### What people are saying - Write a review

#### Review: Queueing Systems, Volume 1: Theory

User Review - Dan - GoodreadsI can't say I read the whole thing. The parts that I did read had great mathematical beauty. A good writer, and a deep mathematician. Read full review

#### Review: Queueing Systems, Volume 1: Theory

User Review - Bob - GoodreadsUsed as a textbook by Prof. J. Laurie Snell, Mathematics Department, Dartmouth College for an elective topics course in Operations Research, Fall 1979. Read full review

### Contents

A Queueing Theory Primer | 1 |

The Queue GMm 241 | 6 |

Bounds Inequalities and Approximations | 27 |

Copyright | |

13 other sections not shown

### Common terms and phrases

allocation ARPANET arrival rate assume attained service average number average waiting backlog behavior bribe buffer calculate capacity channel channel capacity computer networks computer systems condition conservation law consider constant CSMA curves customer arrives define denote destination IMP diffusion approximation equation equilibrium example exponentially distributed finite fluid approximation given in Eq HOST independent input interarrival interval KBPS KLEI Kleinrock Laplace transform length linear costs lower bound M/G/l system mean wait node number of customers optimal optimum packet switching parameters Poisson process priority group priority queueing probability problem processor-sharing quantum queueing discipline Queueing Models queueing system queueing theory random variable RFNM routing procedure scheduling algorithm sec of service Section server service time distribution shown in Figure slotted ALOHA solution solve source IMP tagged customer terminal throughput time-dependent time-shared topology traffic transmission upper bound users variance zero