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

Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1

Author

Listed:
  • S. Pradhan
  • U. C. Gupta

Abstract

Queueing systems with batch Markovian arrival process (BMAP) have paramount applications in the domain of wireless communication. The BMAP has been used to model the superposition of video sources and to approximate the super-position of data, voice and video traffic. This article analyzes an infinite-buffer generally distributed batch-service queue with BMAP, general bulk service (a, b) rule and batch-size-dependent service time. In this proposed analysis, we mainly focus on deriving the bivariate vector generating function of queue and server content distribution together at departure epoch using supplementary variable technique. The mathematical procedure for the complete extraction of distribution at departure epoch has been discussed and using those extracted probabilities, we achieve the queue and server content distribution at arbitrary epoch. Finally, numerical illustrations have been carried out in order to make a deep insight to the readers which contains deterministic as well as phase-type service time distributions.

Suggested Citation

  • S. Pradhan & U. C. Gupta, 2022. "Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(13), pages 4330-4357, June.
    • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:13:p:4330-4357
    DOI: 10.1080/03610926.2020.1813304
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1813304
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1813304?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:51:y:2022:i:13:p:4330-4357. 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.