Fairness and efficiency in web protocols

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 229-237

  Friedman, Eric J ^a   Henderson, Shane G ^a  

^a Cornell University   (United States)

Author keywords

Processor sharing; Starvation avoidance

Indexed keywords

FAIR SOJOURN PROTOCOLS (FSP); PROCESSOR SHARING (PS); SHORTEST REMAINING PROCESSING TIME PROTOCOL (SRPT); STARVATION AVOIDANCE;

COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SYSTEMS; INFORMATION TECHNOLOGY; PROGRAM PROCESSORS;

WORLD WIDE WEB;

EID: 33646170263     PISSN: 01635999     EISSN: 01635999     Source Type: Conference Proceeding    
DOI: 10.1145/885651.781056     Document Type: Conference Paper

References (16)

1. N. Bansal and M. Harchol-Balter. Analysis of SRPT scheduling: Investigating unfairness. In Proc. ACM Sigmetrics '01, 2001.
2. M. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continous job streams. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.
3. L. Cherkasova. Scheduling strategies to improve response time for web applications. InHigh-Performance Computing and Networking: International Conference and Exhibition, pages 305-314, 1998.
4. H. Ores and H. Moulin. Scheduling with opting out: Improving upon random priority. Operations Research, 49(4):565-577, 2001.
5. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of Internetworking, 1(1):3-26, Jan. 1990.
6. M. Harchol-Balter, N. Bansal, B. Schroeder, and M. Agrawal. Size-based scheduling to improve web performance. Mimeo, CMU, 2001.
7. E. Modiano. Scheduling algorithms for message transmission over a satellite broadcast system. In Proceedings of IEEE MILCOM97, pages 628-634, 1997.
8. E. Modiano. Scheduling packet transmissions in a multi-hop packet switched network based on message length. In International Conference on Computer Communications and Networks, 1997.
9. H. Moulin. Axioms of Cooperative Decision Making. Cambridge University Press, New York, 1991.
10. H. Moulin. Axiomatic cost and surplus-sharing. In Arrow, Sen, and Suzumura, editors, Handbook of Social Choice and Welfare. North-Holland, New York, 2002.
11. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking (TON), 1(3):344-357, 1993.
12. L. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:687-690, 1968.
13. D. Smith. A new proof of the optimality of the shortest remaining processing time discipline. Operations Research, 26:197-199, 1976.
14. W. Stallings. Operating Systems. Prentice Hall, 2nd edition, 1995.
15. A. Tanenbaum. Modern Operating Systems. Prentice Hall, 1992.
16. H. P. Young. Cost Allocation: Methods, Principles and Applications. Elsevier Science, New York, 1985.