Data networks
Continuous-time Markov chains and applications: a singular perturbation approach
Continuous-time Markov chains and applications: a singular perturbation approach
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth sharing: objectives and algorithms
IEEE/ACM Transactions on Networking (TON)
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
Insensitivity in processor-sharing networks
Performance Evaluation
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
A survey on discriminatory processor sharing
Queueing Systems: Theory and Applications
The impact of reneging in processor sharing queues
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On processor sharing and its applications to cellular data network provisioning
Performance Evaluation
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Comparison of bandwidth-sharing policies in a linear network
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Monotonicity Properties for Multi-Class Queueing Systems
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
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.