On Kelly networks with shuffling

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.

• Type: Journal
• Year: 2008
• Where: QUESTA
• Authors: T. Bonald, M.-A. Tran
• Keywords: Customer, Network State, QUESTA 2008, Shuffle