Abstract
This chapter analyzes queueing systems fed by Gaussian inputs. The analysis is of an asymptotic nature, in that the number of sources is assumed large, where link bandwidth and buffer space are scaled accordingly. Relying on powerful largedeviation techniques (in particular Schilder’s theorem), we identify the exponential decay rate of the overflow for the single queue. In addition we establish a number of appealing results (duality between decay rate and variance function; convexity of buffer/bandwidth trade-off curve). Then we extend the result to the tandem setting; a lower bound on the decay rate is found, which is proven to be ‘tight’ under specificconditions. Also approximations for the overflow probability are presented. The lastpart of the chapter is devoted to priority systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Mandjes, M. (2011). Queueing Networks with Gaussian Inputs. In: Boucherie, R., van Dijk, N. (eds) Queueing Networks. International Series in Operations Research & Management Science, vol 154. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6472-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6472-4_12
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6471-7
Online ISBN: 978-1-4419-6472-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)