On Stochastic Bounds for Monotonic Processor Sharing Networks

Thomas Bonald (1, 2) , Alexandre Proutière (2, 1)

1 TREC - Theory of networks and communications
2 Orange Labs [Paris]

We consider a network of processor sharing nodes with independent Poisson arrival processes. Nodes are coupled through their service capacity in that the speed of each node depends on the number of customers present at this and any other node. We assume the network is monotonic in the sense that removing a customer from any node increases the service rate of all customers. Under this assumption, we give stochastic bounds on the number of customers present at any node. We also identify limiting regimes that allow to test the tightness of these bounds. The bounds and the limiting regimes are insensitive to the service time distribution. We apply these results to a number of practically interesting systems, including the discriminatory processor sharing queue, the generalized processor sharing queue, and data networks whose resources are shared according to max–min fairness.

Mots clés: processor sharing networks; stochastic bounds; balance; monotonicity; insensitivity

Domaines: Réseaux et télécommunications [cs.NI]; Performance et fiabilité [cs.PF]

Thomas Bonald, Alexandre Proutière. On Stochastic Bounds for Monotonic Processor Sharing Networks. Queueing Systems, 2004, ⟨10.1023/B:QUES.0000032802.41986.c6⟩. ⟨hal-01285972⟩