Article contents
A generalisation of erlang's formulas in queueing theory
Published online by Cambridge University Press: 14 July 2016
Extract
We follow the terminology of Khintchine's monograph [4].
Let us consider a random stream of calls entering a service system which consists of n lines. The service durations are assumed to be identically distributed random variables which are independent both of each other and of the course of the incoming stream.
- Type
- Research Papers
- Information
- Copyright
- Copyright © Sheffield: Applied Probability Trust
References
- 2
- Cited by