Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stability of Data Networks: Stationary and Bursty Models
Operations Research
Diffusion limit of a two-class network: stationary distributions and interchange of limits
ACM SIGMETRICS Performance Evaluation Review
On optimal worst-case matching
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Short communication: Network iso-elasticity and weighted α-fairness
Performance Evaluation
Hi-index | 0.00 |
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use only one server. The traffic intensity is such that both servers are bottlenecks, meaning the service capacity is equal to the offered workload. The real-time allocation of the service capacity among the job classes takes the form of a solution to an optimization problem that maximizes a utility function. We derive the diffusion limit of the network and establish its asymptotic optimality. In particular, we identify a cost objective associated with the utility function and show that it is minimized at the diffusion limit by the utility-maximizing allocation within a broad class of “fair” allocation schemes. The model also highlights the key issues involved in multiple bottlenecks.