Most probable paths and performance formulae for buffers with gaussian input traffic

Abstract

Abstract In this paper, performance formulae for a queue serving Gaussian traffic are presented. The main technique employed is motivated by a general form of Schilder's theorem, the large deviation result for Gaussian processes. Most probable paths leading to a given buffer occupancy are identified. Special attention is given to the case where the sample pams of die Gaussian process are smooth. The performance approximations are compared with known analytical results or by means of simulation. The approximations appear to be surprisingly accurate.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 72 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.