Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv*, Rita Zlotnikov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models 20 (2004) 149-172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to the second queue. Second, we observe that given that the second server is busy, the two queue lengths are independent. Third, we develop two computational schemes for the stationary distribution of the two-dimensional Markov process underlying this model, one with a complexity of $O(n \log\delta-1)$, the other with a complexity of $O(\log n\log2-1)$, where δ is the tolerance criterion.

Original languageEnglish
Pages (from-to)17-36
Number of pages20
JournalRAIRO - Operations Research
Volume45
Issue number1
DOIs
StatePublished - Jan 2011

Keywords

  • Matrix geometric
  • Memoryless queues
  • Quasi birth and death processes

Fingerprint

Dive into the research topics of 'Computational schemes for two exponential servers where the first has a finite buffer'. Together they form a unique fingerprint.

Cite this