1968
DOI: 10.2307/3212082
|View full text |Cite
|
Sign up to set email alerts
|

A generalisation of erlang's formulas in queueing theory

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1974
1974
1996
1996

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 4 publications
0
0
0
Order By: Relevance