Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-09T21:53:15.389Z Has data issue: false hasContentIssue false
  • English
  • Français

Queue length for the Ek/G/1 queue by finite waiting room

Published online by Cambridge University Press:  01 July 2016

A. L. Truslove
A. L. Truslove*
Affiliation:
Monash University, Clayton, Australia
Get access Rights & Permissions [Opens in a new window]

Abstract

For the Ek/G/1 queue with finite waiting room the phase technique is used to analyse the Markov chain imbedded in the queueing process at successive instants at which customers complete service, and the distribution of queue length is obtained. The limit as the size of the waiting room becomes infinite is found.

Keywords

FINITE WAITING ROOMQUEUE LENGTHERLANG INPUTPHASE TECHNIQUEMARKOV CHAIN
Type
Research Article
Information
Advances in Applied Probability , Volume 7 , Issue 1 , March 1975 , pp. 215 - 226
Copyright
Copyright © Applied Probability Trust 1975 

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

Fabens, A. J. (1959) The solution of queueing and inventory models. Technical Report No. 20 Dept. of Statistics, Stanford University.Google Scholar
Pollaczek, F. (1957) Problèmes stochastiques posés par le phénomène de formation d'une queue d'attente à un guichet et par des phénomènes apparentés. Gauthiers-Villars, Paris.Google Scholar
Takács, L. (1961) Transient behaviour of single server queueing processes with Erlang input. Trans. Amer. Math. Soc. 100, 1–28.CrossRefGoogle Scholar