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

Performability analysis of a MMAP[2]/PH[2]/S model with PH retrial times

Author

Listed:
  • Vidyottama Jain
  • Raina Raj
  • S. Dharmaraja

Abstract

This work focuses over the performability analysis of a multi-server retrial queueing model with phase-type inter-retrial times in cellular networks. It is considered that the pattern of the new call arrival and handoff call arrival follows marked Markovian arrival process. The service times of both types of calls are phase-type (PH) distributed with different parameters, and inter-failure & inter-repair times of channels are exponentially distributed. For the prioritization of handoff calls, G channels are kept in reserve for handoff calls. When all the available channels, say S, are busy at the arrival epoch of a handoff call, the handoff call will be dropped. Whereas a new call will be blocked and will have an option to join the orbit of infinite capacity or leave the system without getting the connection, if at least S−G channels are busy. A new call in the orbit, termed as retrial call, retries to get the connection after a random interval which follows PH distribution. This model is analyzed as a level-dependent-quasi-birth-death process by applying an efficient method. Through numerical illustrations, the behavior of performance measures depending on the various relevant intensities is discussed.

Suggested Citation

  • Vidyottama Jain & Raina Raj & S. Dharmaraja, 2024. "Performability analysis of a MMAP[2]/PH[2]/S model with PH retrial times," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(8), pages 2868-2887, April.
    • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:8:p:2868-2887
    DOI: 10.1080/03610926.2022.2150053
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2150053
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2022.2150053?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:53:y:2024:i:8:p:2868-2887. 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.