Answers are grounded in this paper and cite their sources.
Various elegant properties have been found for the waiting time distributionGfor the queue GI/G/1 in statistical equilibrium, such as infinite divisibility ((1), p. 282) and that of having an exponential tail ((11), (2), p. 411, (1), p. 324). Here we derive another property which holds quite generally, provided the traffic intensity ρ < 1, and which is extremely simple, fitting in with the above results as well as yielding some useful properties in the form of upper and lower stochastic bounds forGwhich augment the bounds obtained by Kingman (5), (6), (8) and by Ross (10).
No takes yet. Share an insight, caveat, or question.
J. Köllerström (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: