Queueing Networks with Gaussian Inputs

Michel Mandjes ()
Additional contact information
Michel Mandjes: University of Amsterdam

Chapter 12 in Queueing Networks, 2011, pp 531-560 from Springer

Abstract: 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.

Keywords: Decay Rate; Gaussian Process; Variance Function; Buffer Size; Busy Period (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6472-4_12

Ordering information: This item can be ordered from
http://www.springer.com/9781441964724

DOI: 10.1007/978-1-4419-6472-4_12

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().