Revisiting unfairness in Web server scheduling

Computer Networks

Volumn 50, Issue 13, 2006, Pages 2183-2203

  Gong, Mingwei ^a   Williamson, Carey ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Fairness; Performance analysis; Scheduling; Simulation; Web server performance

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DATA PROCESSING; SENSITIVITY ANALYSIS; SERVERS; WORLD WIDE WEB;

EMPIRICAL WORKLOAD; FAIRNESS; PERFORMANCE ANALYSIS; WEB SERVER PERFORMANCE;

SCHEDULING;

EID: 33745643560     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.08.005     Document Type: Article

References (33)

1. Arlitt M., and Jin T. A workload characterization study of the 1998 World Cup Web Site. IEEE Network 14 3 (2000) 30-37
2. Arlitt M., and Williamson C. Internet Web servers: workload characterization and performance implications. IEEE/ACM Transactions on Networking 5 5 (1997) 631-645
3. Avi-Itzhak B., and Levy H. On measuring fairness in queues. Advances in Applied Probability 36 3 (2004) 919-936
4. N. Bansal, M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, in: Proceedings of ACM SIGMETRICS Conference, Cambridge, MA, June 2001, pp. 279-290.
5. Barford P., and Crovella M. Measuring Web performance in the wide area. ACM Performance Evaluation Review 27 2 (1999) 37-48
6. M. Crovella, R. Frangioso, M. Harchol-Balter, Connection scheduling in Web servers, in: Proceedings of USENIX Symposium on Internet Technologies and Systems (USITS), Boulder, CO, October 1999.
7. M. Crovella, M. Harchol-Balter, S. Park, The case for SRPT scheduling in Web servers, Technical Report MIT-LCS-TR-767, MIT Laboratory for Computer Science, October 1998.
8. Crovella M., Taqqu M., and Bestavros A. Heavy-tailed probability distributions in the World Wide Web. A Practical Guide To Heavy Tails (1998), Chapman and Hall, New York pp. 3-26 (Chapter 1)
9. E. Friedman, S. Henderson, Fairness and efficiency in Web server protocols, in: Proceedings of ACM SIGMETRICS Conference, San Diego, CA, June 2003, pp. 229-237.
10. M. Gong, Quantifying unfairness in Web server scheduling, M.Sc. Thesis, Department of Computer Science, University of Calgary, July 2003.
11. M. Gong, C. Williamson, Quantifying the properties of SRPT scheduling, in: Proceedings of IEEE/ACM MASCOTS, Orlando, FL, October 2003, pp. 126-135.
12. M. Gong, C. Williamson, Simulation evaluation of hybrid SRPT scheduling policies, in: Proceedings of IEEE/ACM MASCOTS, Volendam, Netherlands, October 2004, pp. 355-363.
13. M. Grossglauser, J.-C. Bolot, On the relevance of long-range dependence in network traffic, in: Proceeedings of ACM SIGCOMM'96, Stanford, CA, August 1996, pp. 15-24.
14. Hahne E. Round-Robin scheduling for Max-Min fairness in data networks. IEEE Journal on Selected Areas in Communication 9 7 (1991) 1024-1039
15. Harchol-Balter M., Schroeder B., Bansal N., and Agrawal M. Size-based scheduling to improve Web performance. ACM Transactions on Computer Systems 21 2 (2003) 207-233
16. M. Harchol-Balter, K. Sigman, A. Wierman, Asymptotic convergence of scheduling policies with respect to slowdown, in: Proceedings of IFIP Performance 2002, Rome, Italy, September 2002, pp. 241-256.
17. Internet Traffic Archive. Available from: .
18. Leland W., Taqqu M., Willinger W., and Wilson D. On the self-similar nature of ethernet traffic extended version. IEEE/ACM Transactions on Networking 2 1 (1994) 1-15
19. D. Lu, H. Shen, P. Dinda, Size-based scheduling policies with inexact scheduling information, in: Proceedings of IEEE/ACM MASCOTS, Volendam, Netherlands, October 2004, pp. 31-38.
20. N. Markatchev, C. Williamson, WebTraff: a GUI for Web proxy cache workload modeling and analysis, in: Proceedings of IEEE MASCOTS, Fort Worth, TX, October 2002, pp. 356-363.
21. Muthukrishnan S., Rajaraman R., Shaheen A., and Gehrke J. Online scheduling to minimize average stretch. IEEE Symposium on Foundations of Computer Science (1999) 433-442
22. E. Nahum, M. Rosu, S. Seshan, J. Almeida, The effects of wide-area conditions on WWW server performance, in: Proceedings of ACM SIGMETRICS Conference, Cambridge, MA, June 2001, pp. 257-267.
23. Paxson V., and Floyd S. Wide area traffic: the failure of poisson modeling. IEEE/ACM Transactions on Networking 3 3 (1994) 226-244
24. Perera R. The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv für Elektronik und Übertragungstechnik 47 (1993) 110-114
25. I. Rai, G. Urvoy-Keller, E. Biersack, Analysis of LAS scheduling for job size distributions with high variance, in: Proceedings of ACM SIGMETRICS Conference, San Diego, CA, June 2003, pp. 218-238.
26. D. Raz, H. Levy, B. Avi-Itzhak, RAQFM: a resource allocation queueing fairness measure, in: Proceedings of ACM SIGMETRICS Conference, New York, NY, June 2004.
27. Schassberger R. The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time. Advanced Applied Probability 22 (1990) 456-479
28. Schrage L. A proof of the optimality of the shortest remaining processing time discipline. Operations Research 16 (1968) 678-690
29. Schrage L., and Miller L. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14 (1966) 670-684
30. Schreiber F. Properties and applications of the optimal queueing strategy SRPT: a survey. Archiv für Elektronik und Übertragungstechnik 47 (1993) 372-378
31. B. Schroeder, M. Harchol-Balter, Web servers under overload: how scheduling can help", ACM Transactions on Internet Technology, in press.
32. Smith D. A new proof of the optimality of the shortest remaining processing time discipline. Operations Research 26 (1976) 197-199
33. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/GI/1, in: Proceedings of ACM SIGMETRICS Conference, San Diego, CA, June 2003, pp. 238-249.