IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i1d10.1007_s10479-023-05728-1.html
   My bibliography  Save this article

Queueing system with control by admission of retrial requests depending on the number of busy servers and state of the underlying process of Markov arrival process of primary requests

Author

Listed:
  • Alexander Dudin

    (Belarusian State University)

  • Achyutha Krishnamoorthy

    (CMS College)

  • Sergei Dudin

    (Belarusian State University)

  • Olga Dudina

    (Belarusian State University)

Abstract

A multi-server retrial queuing model is under study. Arrivals occur according to the Markov arrival process (MAP). Aiming to increase the probability of immediate access of arriving requests to service, control by the admission of retrying requests, which did not succeed to start service immediately after arrival, is supposed. A control strategy is determined by the set of the integer thresholds defined for each value of the underlying Markov chain of the MAP. Any retrying request is accepted for service if the number of busy servers is less than the threshold corresponding to the current state of the underlying Markov chain. Retrying requests are impatient and can depart from the system without receiving service. Dynamics of the system is described by the three-dimensional Markov chain. Its generator is obtained, steady-state probabilities are computed and formulas for computation of certain performance measures are given. Numerical examples are presented including illustration of a possibility to use the obtained results for managerial goals.

Suggested Citation

  • Alexander Dudin & Achyutha Krishnamoorthy & Sergei Dudin & Olga Dudina, 2024. "Queueing system with control by admission of retrial requests depending on the number of busy servers and state of the underlying process of Markov arrival process of primary requests," Annals of Operations Research, Springer, vol. 335(1), pages 135-150, April.
    • Handle: RePEc:spr:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05728-1
    DOI: 10.1007/s10479-023-05728-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05728-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05728-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:annopr:v:335:y:2024:i:1:d:10.1007_s10479-023-05728-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.