IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i17p6207-6231.html
   My bibliography  Save this article

Analysis of a retrial queueing system with priority service and modified multiple vacations

Author

Listed:
  • Jia Xu
  • Liwei Liu
  • Kan Wu

Abstract

This paper studies an M/G/1 retrial queueing system with modified multiple vacations, in which a new external arrival may expel the customer being served out of the system and directly starts to be served or join the retrial orbit. Once the server finds the orbit is empty at the end of a service, it will immediately take a random length vacation. If the orbit is still empty when a vacation is finished, the server takes another same vacation. This pattern continues until the orbit is not empty when a vacation is completed or the server has already taken M vacations. By constructing an embedded Markov chain, we provide the sufficient and necessary condition of system stability. The distributions of the orbit size and the system size in steady-state are derived through the supplementary variable method. Then, some system performance measures and the Laplace-Stieltjes transform of sojourn time distribution are obtained. Besides, we perform the cost analysis of the system. Finally, several numerical illustrations are given to investigate the effects of system parameters on the essential system characteristics.

Suggested Citation

  • Jia Xu & Liwei Liu & Kan Wu, 2023. "Analysis of a retrial queueing system with priority service and modified multiple vacations," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(17), pages 6207-6231, September.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:17:p:6207-6231
    DOI: 10.1080/03610926.2022.2027448
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2027448
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2022.2027448?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.

    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:taf:lstaxx:v:52:y:2023:i:17:p:6207-6231. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.