Fairness and efficiency in web server protocols
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
Under very general assumptions, we prove that the ratio between the average sojourn time in a queue under the processor sharing (PS) and the same queue under the fair sojourn protocol (FSP) can be bounded above, and we derive such a bound in terms of the long-run average system size of the PS queue seen by arrivals.