Insensitivity in processor-sharing networks - Archive ouverte HAL Access content directly
Journal Articles Performance Evaluation Year : 2002

Insensitivity in processor-sharing networks

(1) , (1)
1

Abstract

We consider an open network of processor-sharing nodes with state-dependent service capacities, i.e., the speed of each node may depend on the number of customers at any node. We demonstrate that the stationary distribution of the network state is insensitive to the distribution of service times if and only if the service capacities are balanced, i.e., the considered network is a Whittle network. The stationary distribution then has a closed-form expression and the expected sojourn time of a customer at any node is proportional to its required quantity of service. These results are extended to the cases of closed networks and state-dependent arrival rates and routing. Two simple examples illustrate the practical interest of these results in the context of communication networks.
Fichier principal
Vignette du fichier
perf02.pdf (11.92 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01267145 , version 1 (04-02-2016)

Identifiers

  • HAL Id : hal-01267145 , version 1

Cite

Thomas Bonald, Alexandre Proutière. Insensitivity in processor-sharing networks. Performance Evaluation, 2002. ⟨hal-01267145⟩
165 View
112 Download

Share

Gmail Facebook Twitter LinkedIn More