Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T16:46:57.195Z Has data issue: false hasContentIssue false

Exact overflow asymptotics for queues with many Gaussian inputs

Published online by Cambridge University Press:  14 July 2016

Krzysztof Dębicki*
Affiliation:
CWI, Amsterdam, and University of Wrocław
Michel Mandjes*
Affiliation:
CWI, Amsterdam, and University of Twente
*
∗ Postal address: Mathematical Institute, University of Wrocław, pl. Grunwaldzki 2/4, 50-384 Wrocław, Poland. Email address: debicki@math.uni.wroc.pl
∗∗ Postal address: CWI, PO Box 94079, 1090 GB Amsterdam, The Netherlands

Abstract

In this paper we consider a queue fed by a large number of independent continuous-time Gaussian processes with stationary increments. After scaling the buffer exceedance threshold and the (constant) service capacity by the number of sources, we present asymptotically exact results for the probability that the buffer threshold is exceeded. We consider both the stationary overflow probability and the (transient) probability of overflow at a finite time horizon. We give detailed results for the practically important cases in which the inputs are fractional Brownian motion processes or integrated Gaussian processes.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2003 

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