Title
Most probable paths and performance formulae for buffers with gaussian input traffic
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 paths of the 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.
Year
DOI
Venue
2002
10.1002/ett.4460130303
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS
Keywords
Field
DocType
gaussian process
Telecommunications network,Gaussian random field,Computer science,Simulation,Queue,Algorithm,Electronic engineering,Gaussian,Gaussian process,Queueing system,Statistical model
Journal
Volume
Issue
ISSN
13
3
1120-3862
Citations 
PageRank 
References 
24
2.28
5
Authors
3
Name
Order
Citations
PageRank
Ron Addie116821.39
Petteri Mannersalo223418.96
Ilkka Norros361386.52