Insensitive Queueing Models for Communication Networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Insensitive Queueing Models for Communication Networks

(1)
1
Thomas Bonald

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.
Fichier principal
Vignette du fichier
valuetools.pdf (130.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01244211 , version 1 (15-12-2015)

Identifiers

  • HAL Id : hal-01244211 , version 1

Cite

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

Collections

INSMI
52 View
288 Download

Share

Gmail Facebook Twitter LinkedIn More