Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Reference2 articles.
1. 1. Friedman E.J. & Henderson S.G. (2003). Fairness and efficieny in web server protocols. Proceedings of ACM/SIGMETRIC’03 .
2. 2. Wierman A. & Harchol-Balter M. (2003). Bounds on a fair policy with near optimal performance. Technical report, Pittsburg: Cornegie Mellon University.