Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-07T11:49:54.913Z Has data issue: false hasContentIssue false

Overflow Asymptotics for large Communications Systems with General Markov Fluid Sources

Published online by Cambridge University Press:  27 July 2009

Michel Mandjes
Affiliation:
Department of Econometrics, Vrije Universiteit Amsterdam, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands

Extract

This paper is concerned with overflows in queues fed by Markov fluid input. The results are asymptotic in the number of sources; that is, we let the number of users grow large. The main objectives of this study are to characterize both overflow probability and the “most probable way” in which overflow occurs. Applying large deviations techniques, known results (Weiss, 1986, Advances in Applied Probability 18: 506–532) for exponential on-off sources are extended to general Markov fluid input. Successively, zero, small, and large buffers are treated. Finally, results for multiclass input are given.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable