Analyzing GI/E_r/1 queues

I.J.B.F. Adan, Y. Zhao

Research output: Contribution to journalArticleAcademicpeer-review

15 Citations (Scopus)
1 Downloads (Pure)

Abstract

In this paper we study a single-server system with Erlang-r distributed service times and arbitrarily distributed interarrival times. It is shown that the waiting-time distribution can be expressed as a finite sum of exponentials, the exponents of which are the roots of an equation. Under certain conditions for the interarrival-time distribution, this equation can be transformed to r contraction equations, the roots of which can easily be found by successive substitutions. The conditions are satisfied for several practically relevant arrival processes. The resulting numerical procedures are easy to implement and efficient and appear to be remarkably stable, even for extremely high values of r andfor values of the traffic load close to 1. Numerical results are presented.
Original languageEnglish
Pages (from-to)183-190
Number of pages8
JournalOperations Research Letters
Volume19
Issue number4
DOIs
Publication statusPublished - 1996

Fingerprint

Dive into the research topics of 'Analyzing GI/E_r/1 queues'. Together they form a unique fingerprint.

Cite this