Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Proof of the conjecture on the stability of a multiserver retrial queue
- Authors
- Kim, Bara; Kim, Jeongsim
- Issue Date
- 5월-2015
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- Retrial queue; Markov process; Stability; Lyapunov function
- Citation
- OPERATIONS RESEARCH LETTERS, v.43, no.3, pp.236 - 240
- Indexed
- SCIE
SCOPUS
- Journal Title
- OPERATIONS RESEARCH LETTERS
- Volume
- 43
- Number
- 3
- Start Page
- 236
- End Page
- 240
- ISSN
- 0167-6377
- 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 rho(infinity) < 1 and transient if rho(infinity) > 1, where rho(infinity) is the traffic load under the saturation condition of the orbit. We also investigate the critical case when rho(infinity) = 1 to see if it can be either stable or unstable. (C) 2015 Elsevier B.V. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.