Queueing Theory for Telecommunications

by John N. Daigle

According to the author, John Daigle, queuing theory is the study of the behavior of waiting lines. A typical queuing problem involves a system that services customers whose service requests occur according to some random process. The time required for the server(s) to service a request is also typically random. In general, arrivals and service completions cannot be synchronized, so waiting time may result. Some typical queuing system questions include; what is the distribution of time a typical customer will have to wait; what is the distribution of the number of customers in the system at an arbitrary point in time; how large should the waiting room be to accomodate 99% of the potential customers? In his exploration of this concept, Daigle also looks at predictive models in computer communication networks, queuing terminology, distribution concepts, time-dependent occupancy, stochastic equilibrium, busy period analysis, finite-state systems, balance equation approaches, probability generating functions, matrix geometric methods, expected waiting times.

310 pages, Hardcover

First published August 1, 1991