IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p3-2610.1023-a1018930907280.html
   My bibliography  Save this article

Large deviations of the sojourn time for queues in series

Author

Listed:
  • A.J. Ganesh

Abstract

We consider an open queueing network consisting of an arbitrary number of queues in series. We assume that the arrival process into the first queue and the service processes at the individual queues are jointly stationary and ergodic, and that the mean inter-arrival time exceeds the mean service time at each of the queues. Starting from Lindley's recursion for the waiting time, we obtain a simple expression for the total delay (sojourn time) in the system. Under some mild additional assumptions, which are satisfied by many commonly used models, we show that the delay distribution has an exponentially decaying tail and compute the exact decay rate. We also find the most likely path leading to the build-up of large delays. Such a result is of relevance to communication networks, where it is often necessary to guarantee bounds on the probability of large delays. Such bounds are part of the specification of the quality of service desired by the network user. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • A.J. Ganesh, 1998. "Large deviations of the sojourn time for queues in series," Annals of Operations Research, Springer, vol. 79(0), pages 3-26, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:3-26:10.1023/a:1018930907280
    DOI: 10.1023/A:1018930907280
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018930907280
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018930907280?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. O'Connell, Neil & Yor, Marc, 2001. "Brownian analogues of Burke's theorem," Stochastic Processes and their Applications, Elsevier, vol. 96(2), pages 285-304, December.
    2. Marcos Singer & Patricio Donoso & José Noguer, 2005. "Optimal Planning of a Multi-Station System with Sojourn Time Constraints," Annals of Operations Research, Springer, vol. 138(1), pages 203-222, September.
    3. Anne Buijsrogge & Pieter-Tjerk Boer & Karol Rosen & Werner Scheinhardt, 2017. "Large deviations for the total queue size in non-Markovian tandem queues," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 305-312, April.

    More about this item

    Keywords

    large deviations; tandem queues;

    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:spr:annopr:v:79:y:1998:i:0:p:3-26:10.1023/a:1018930907280. 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.