Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-11T08:15:01.683Z Has data issue: false hasContentIssue false

On the many server queue with exponential service times

Published online by Cambridge University Press:  01 July 2016

J. H. A. De Smit*
Affiliation:
Center for Operations Research and Econometrics, University of Louvain

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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1973 

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.)

Article purchase

Temporarily unavailable