On the many server queue with exponential service times

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1973 English Publisher:Cambridge University Press (CUP)Journal:Advances in Applied Probability, volume 5, pages 170-182 (issn: 0001-8678, eissn: 1475-6064,

Copyright policy )

Authors: De Smit, J. H. A.;

doi: 10.2307/1425970

On the many server queue with exponential service times

- Summary
- Subjects
- Metrics

Abstract

The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the number of busy servers, the busy period and the busy cycle. Most of these results are new, even for the special case of Poisson arrivals.

Related Organizations

Université Catholique de Louvain
Belgium

Keywords

Queueing theory (aspects of probability theory)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	15
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average