Abstract
A general procedure is outlined for obtaining lower bounds and approximations to the amount of congestion in queues with low traffic. Some detailed formulae are given for a number of single-server systems and compared with exact solutions where available. Results are also given for a discrete time system in which departures clash with new arrivals.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability