Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1023/B:QUES.0000032802.41986.c6 | Queueing Syst. |
Keywords | Field | DocType |
processor sharing networks,stochastic bounds,balance,monotonicity,insensitivity | Monotonic function,Computer science,Queue,Real-time computing,Processor sharing,Processor sharing queue,Generalized processor sharing,Poisson distribution,Service time,Limiting,Distributed computing | Journal |
Volume | Issue | ISSN |
47 | 1/2 | 1572-9443 |
Citations | PageRank | References |
11 | 0.84 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Bonald | 1 | 501 | 40.32 |
| A. Proutiére | 2 | 673 | 51.18 |