Skip to Main content Skip to Navigation
Journal articles

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 metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Thomas Bonald Connect in order to contact the contributor
Submitted on : Tuesday, December 15, 2015 - 2:59:11 PM
Last modification on : Friday, December 20, 2019 - 10:14:14 AM
Long-term archiving on: : Saturday, April 29, 2017 - 3:05:04 PM


Files produced by the author(s)




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



Les métriques sont temporairement indisponibles