Bursty traffic and finite capacity queues

Fergal Toomey

Annals of Operations Research, 1998, vol. 79, issue 0, 45-62

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

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018991225935 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:79:y:1998:i:0:p:45-62:10.1023/a:1018991225935

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018991225935

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().