Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-24T20:42:15.838Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalisation of erlang's formulas in queueing theory

Published online by Cambridge University Press:  14 July 2016

D. Mejzler
D. Mejzler*
Affiliation:
The Hebrew University of Jerusalem
Get access Rights & Permissions [Opens in a new window]

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
Journal of Applied Probability , Volume 5 , Issue 1 , April 1968 , pp. 143 - 157
Copyright
Copyright © Sheffield: Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Erlang, A. K. (1917–18) Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Post Office Electrical Engineer's Journal 10, 189–197.Google Scholar
[2] Fortet, R. (1950) Calcul de Probabilités. Centre National de la Recherche Scientifique, Paris.Google Scholar
[3] Gnedenko, B. V. (1962) The Theory of Probability. Chelsea Publishing Company, New York.Google Scholar
[4] Khintchine, A. Ya. (1960) Mathematical Methods in the Theory of Queueing. Charles Griffin, London.Google Scholar
[5] Khintchine, A. Ya. (1962) Erlang's formulas in the theory of mass service. Theor. Probability Appl. 7, No. 3, 320–325.Google Scholar
[6] Mejzler, D. (1965) A note on Erlang's formulas. Israel J. Math. 3, No. 3. 157–162.Google Scholar
[7] Sevast'Yanov, B. A. (1957) An ergodic theorem for Markov processes and its applications to telephone systems with refusals. Theor. Probability Appl. 2, No. 1. 104–112.Google Scholar