Insensitive Queueing Models for Communication Networks

Abstract : A rich class of communication networks can be represented as queueing networks with state-dependent arrival rates and service rates. We provide necessary and sufficient conditions for such queueing networks to be insensitive in the sense that the steady-state distribution depends on the service time distribution at each queue through the mean only. This insensitivity property is key to the development of simple engineering rules that do not require the knowledge of fine traffic statistics.
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01244211
Contributor : Thomas Bonald <>
Submitted on : Tuesday, December 15, 2015 - 3:02:26 PM
Last modification on : Tuesday, January 19, 2016 - 1:01:45 AM
Long-term archiving on : Saturday, April 29, 2017 - 3:04:16 PM

File

valuetools.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01244211, version 1

Collections

Citation

Thomas Bonald. Insensitive Queueing Models for Communication Networks. Valuetools, 2006, Pise, Italy. ⟨hal-01244211⟩

Share

Metrics

Record views

80

Files downloads

163