On Kelly networks with shuffling

Abstract : We consider Kelly networks with shuffling of customers within each queue. Specifically, each arrival, departure or movement of customer from one queue to another triggers a shuffle of the other customers at each queue. The shuffle distribution may depend on the network state and on the customer that triggers the shuffle. We prove that the stationary distribution of the network state remains the same as without shuffling. In particular, Kelly networks with shuffling have the product form. Moreover, the insensitivity property is preserved for symmetric queues.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01244204
Contributor : Thomas Bonald <>
Submitted on : Tuesday, December 15, 2015 - 2:59:11 PM
Last modification on : Friday, February 5, 2016 - 12:47:19 PM
Long-term archiving on : Saturday, April 29, 2017 - 3:05:04 PM

File

final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Bonald, Minh-Anh Tran. On Kelly networks with shuffling. Queueing Systems, Springer Verlag, 2008, ⟨10.1007/s11134-008-9075-8⟩. ⟨hal-01244204⟩

Share

Metrics

Record views

101

Files downloads

174