IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v79y1998i0p45-6210.1023-a1018991225935.html
   My bibliography  Save this article

Bursty traffic and finite capacity queues

Author

Listed:
  • Fergal Toomey

Abstract

Traffic on high-speed networks is expected to be "bursty". This has spurred interest in the queueing properties of bursty traffic models, such as Markov additive processes. These processes have by now been studied extensively by many authors, but almost exclusively in the infinite buffer setting. This paper deals with the case of a finite-buffered queue loaded with bursty traffic. It shows how to calculate the exact solution for the queue length distribution and overflow rate in equilibrium, and also how to find efficient upper and lower bounds for these quantities. In addition, the large buffer asymptotic behaviour of the queue length distribution and overflow rate are studied for a queue loaded with general traffic, using large deviation techniques. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Fergal Toomey, 1998. "Bursty traffic and finite capacity queues," Annals of Operations Research, Springer, vol. 79(0), pages 45-62, January.
    • Handle: RePEc:spr:annopr:v:79:y:1998:i:0:p:45-62:10.1023/a:1018991225935
    DOI: 10.1023/A:1018991225935
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018991225935
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018991225935?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:spr:annopr:v:79:y:1998:i:0:p:45-62:10.1023/a:1018991225935. 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.