IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i3p447-455.html
   My bibliography  Save this article

Distribution of the time to buffer overflow in the M/G/1/N-type queueing model with batch arrivals and multiple vacation policy

Author

Listed:
  • Wojciech M. Kempa
  • Rafał Marjasz

Abstract

A single-channel FIFO queueing model with finite buffer capacity and the multiple vacation policy is investigated, in which jobs arrive according to a compound Poisson process and are being processed individually with a general-type distribution function of the service time. A multiple vacation period, consisting of a number of independent generally-distributed server vacations, is being started each time when the system becomes empty. During this period, the processing of jobs is suspended. Successive server vacations are being initialised until at least one job is present in the buffer at the completion epoch of one of them. A compact formula for the Laplace transform of the distribution of the time to the first buffer overflow, conditioned by initial number of packets present in the buffer, is found. The analytical approach is based on the paradigm of embedded Markov chain, integral equations and Korolyuk’s potential idea. Numerical illustrating examples are attached as well.

Suggested Citation

  • Wojciech M. Kempa & Rafał Marjasz, 2020. "Distribution of the time to buffer overflow in the M/G/1/N-type queueing model with batch arrivals and multiple vacation policy," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(3), pages 447-455, March.
  • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:3:p:447-455
    DOI: 10.1080/01605682.2019.1567651
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1567651
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2019.1567651?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:tjorxx:v:71:y:2020:i:3:p:447-455. 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/tjor .

    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.