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

Stationary joint distribution of a discrete-time group-arrival and batch-size-dependent service queue with single and multiple vacation

Author

Listed:
  • N. Nandy
  • S. Pradhan

Abstract

Discrete-time queueing systems have widespread applications in packet switching networks, internet protocol, Broadband Integrated Services Digital Network (B-ISDN), circuit switched time-division multiple access etc. In this paper, we analyze an infinite-buffer discrete-time group-arrival queue with single and multiple vacation policy where processing/transmission/service times dynamically vary with batch-size under service. The bivariate probability generating function of queue length and server content distribution has been derived first, and from that we extract the joint probabilities in terms of roots of the characteristic equation. We also find the joint distribution at arbitrary and pre-arrival slot. Discrete phase type distribution plays a noteworthy role in order to regulate the high transmission error through a particular channel. In view of this, numerical illustrations include the service time distribution to follow the discrete phase type distribution.

Suggested Citation

  • N. Nandy & S. Pradhan, 2023. "Stationary joint distribution of a discrete-time group-arrival and batch-size-dependent service queue with single and multiple vacation," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(9), pages 3012-3046, May.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:9:p:3012-3046
    DOI: 10.1080/03610926.2021.1966469
    as

    Download full text from publisher

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