No CrossRef data available.
Published online by Cambridge University Press: 24 October 2008
Consider a queueing system M/G/s with the arrival intensity λ, the service time distribution function B(t) (B(0) < 1) having a finite mean and the waiting room size N ≤ ∞. If s < ∞ and N = ∞, we shall also assume that its relative traffic intensity is less than 1. Since the arrival process of this system is Poisson, it is immediate that in this case the distribution of the number of arrivals during an interval is infinitely divisible.