IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v53y2001i1p117-146.html
   My bibliography  Save this article

Burst arrival queues with server vacations and random timers

Author

Listed:
  • Merav Shomrony
  • Uri Yechiali

Abstract

We derive performance measures for burst arrival (e.g. messages of variable length packets) M K /G/1 queues with server vacations, controlled by the, so called, Randomly Timed Gated (RTG) protocol, operating as follows: Whenever the server returns from a (general-type) vacation and initiates a busy period, a Timer with random duration T is activated. If the server empties the queue before time T, he leaves for another vacation. Otherwise (i.e. if there are still customers (packets) in the system when the timer expires), two versions of terminating the busy period, each leading to a different model, are studied: (i). The server completes service (e.g. transmission) only to the customer being served at time T and leaves. (ii). The server leaves immediately. We derive both state-dependent and steady-state performance measures as a function of the (vacation-type dependent variable) number of customers present at the initiation of a busy period. When the vacation policy is specified (i.e. Multiple or Single), we obtain explicit formulas for the various performance measures, derive the distribution and mean of the waiting and sojourn times of a customer, and compare between the two versions. Analysis of the conditions for stability concludes the paper. Copyright Springer-Verlag Berlin Heidelberg 2001

Suggested Citation

  • Merav Shomrony & Uri Yechiali, 2001. "Burst arrival queues with server vacations and random timers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 53(1), pages 117-146, April.
    • Handle: RePEc:spr:mathme:v:53:y:2001:i:1:p:117-146
    DOI: 10.1007/s001860000107
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wojciech M. Kempa, 2016. "Transient workload distribution in the $$M/G/1$$ M / G / 1 finite-buffer queue with single and multiple vacations," Annals of Operations Research, Springer, vol. 239(2), pages 381-400, April.

    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:spr:mathme:v:53:y:2001:i:1:p:117-146. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.