IDEAS home Printed from https://ideas.repec.org/a/hin/jnijsa/7168359.html
   My bibliography  Save this article

Multiserver Queue with Guard Channel for Priority and Retrial Customers

Author

Listed:
  • Kazuki Kajiwara
  • Tuan Phung-Duc

Abstract

This paper considers a retrial queueing model where a group of guard channels is reserved for priority and retrial customers. Priority and normal customers arrive at the system according to two distinct Poisson processes. Priority customers are accepted if there is an idle channel upon arrival while normal customers are accepted if and only if the number of idle channels is larger than the number of guard channels. Blocked customers (priority or normal) join a virtual orbit and repeat their attempts in a later time. Customers from the orbit (retrial customers) are accepted if there is an idle channel available upon arrival. We formulate the queueing system using a level dependent quasi-birth-and-death (QBD) process. We obtain a Taylor series expansion for the nonzero elements of the rate matrices of the level dependent QBD process. Using the expansion results, we obtain an asymptotic upper bound for the joint stationary distribution of the number of busy channels and that of customers in the orbit. Furthermore, we develop an efficient numerical algorithm to calculate the joint stationary distribution.

Suggested Citation

  • Kazuki Kajiwara & Tuan Phung-Duc, 2016. "Multiserver Queue with Guard Channel for Priority and Retrial Customers," International Journal of Stochastic Analysis, Hindawi, vol. 2016, pages 1-23, March.
  • Handle: RePEc:hin:jnijsa:7168359
    DOI: 10.1155/2016/7168359
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJSA/2016/7168359.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/IJSA/2016/7168359.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/7168359?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nesrine Zidani & Natalia Djellab, 2024. "Asymptotic upper bounds for an M/M/C/K retrial queue with a guard channel and guard buffer," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 99(3), pages 365-407, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnijsa:7168359. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.