Proof of the conjecture on the stability of a multiserver retrial queue

Bara Kim; Jeongsim Kim

doi:10.1016/j.orl.2015.02.007

Proof of the conjecture on the stability of a multiserver retrial queue

Bara Kim, Jeongsim Kim

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

In this paper we solve the conjecture made by Avram, Matei and Zhao (2014), on stability condition of an M/M/s retrial queue with Bernoulli acceptance, abandonment and feedback. The Markov process describing this queueing system is positive recurrent if ^ρ∞<1 and transient if ^ρ∞>1, where ^ρ∞ is the traffic load under the saturation condition of the orbit. We also investigate the critical case when ^ρ∞=1 to see if it can be either stable or unstable.

Original language	English
Pages (from-to)	236-240
Number of pages	5
Journal	Operations Research Letters
Volume	43
Issue number	3
DOIs	https://doi.org/10.1016/j.orl.2015.02.007
Publication status	Published - 2015 May

Bibliographical note

Publisher Copyright:
© 2015 Elsevier B.V.

Keywords

Lyapunov function
Markov process
Retrial queue
Stability

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2015.02.007

Cite this

@article{722206e06bea486cb2940b68a9cb3a7a,

title = "Proof of the conjecture on the stability of a multiserver retrial queue",

abstract = "In this paper we solve the conjecture made by Avram, Matei and Zhao (2014), on stability condition of an M/M/s retrial queue with Bernoulli acceptance, abandonment and feedback. The Markov process describing this queueing system is positive recurrent if ρ∞<1 and transient if ρ∞>1, where ρ∞ is the traffic load under the saturation condition of the orbit. We also investigate the critical case when ρ∞=1 to see if it can be either stable or unstable.",

keywords = "Lyapunov function, Markov process, Retrial queue, Stability",

author = "Bara Kim and Jeongsim Kim",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2015",

month = may,

doi = "10.1016/j.orl.2015.02.007",

language = "English",

volume = "43",

pages = "236--240",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Proof of the conjecture on the stability of a multiserver retrial queue

AU - Kim, Bara

AU - Kim, Jeongsim

PY - 2015/5

Y1 - 2015/5

N2 - In this paper we solve the conjecture made by Avram, Matei and Zhao (2014), on stability condition of an M/M/s retrial queue with Bernoulli acceptance, abandonment and feedback. The Markov process describing this queueing system is positive recurrent if ρ∞<1 and transient if ρ∞>1, where ρ∞ is the traffic load under the saturation condition of the orbit. We also investigate the critical case when ρ∞=1 to see if it can be either stable or unstable.

AB - In this paper we solve the conjecture made by Avram, Matei and Zhao (2014), on stability condition of an M/M/s retrial queue with Bernoulli acceptance, abandonment and feedback. The Markov process describing this queueing system is positive recurrent if ρ∞<1 and transient if ρ∞>1, where ρ∞ is the traffic load under the saturation condition of the orbit. We also investigate the critical case when ρ∞=1 to see if it can be either stable or unstable.

KW - Lyapunov function

KW - Markov process

KW - Retrial queue

KW - Stability

UR - http://www.scopus.com/inward/record.url?scp=84924767138&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2015.02.007

DO - 10.1016/j.orl.2015.02.007

M3 - Article

AN - SCOPUS:84924767138

SN - 0167-6377

VL - 43

SP - 236

EP - 240

JO - Operations Research Letters

JF - Operations Research Letters

IS - 3

ER -

Proof of the conjecture on the stability of a multiserver retrial queue

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this