An extension of Erlang's formulas which distinguishes individual servers
- 1 March 1972
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 9 (01) , 192-197
- https://doi.org/10.1017/s0021900200094808
Abstract
For a particular kind of finite-server loss system in which the number and identity of servers depends on the type of the arriving call and on the state of the system, the limits of the state probabilities (as t → ∞) are found for an arbitrary service-time distribution.Keywords
This publication has 1 reference indexed in Scilit:
- An Ergodic Theorem for Markov Processes and Its Application to Telephone Systems with RefusalsTheory of Probability and Its Applications, 1957