skip to main content
article

Size-based scheduling to improve web performance

Published:01 May 2003Publication History
Skip Abstract Section

Abstract

Is it possible to reduce the expected response time of every request at a web server, simply by changing the order in which we schedule the requests? That is the question we ask in this paper.This paper proposes a method for improving the performance of web servers servicing static HTTP requests. The idea is to give preference to requests for small files or requests with short remaining file size, in accordance with the SRPT (Shortest Remaining Processing Time) scheduling policy.The implementation is at the kernel level and involves controlling the order in which socket buffers are drained into the network. Experiments are executed both in a LAN and a WAN environment. We use the Linux operating system and the Apache and Flash web servers.Results indicate that SRPT-based scheduling of connections yields significant reductions in delay at the web server. These result in a substantial reduction in mean response time and mean slowdown for both the LAN and WAN environments. Significantly, and counter to intuition, the requests for large files are only negligibly penalized or not at all penalized as a result of SRPT-based scheduling.

References

  1. Almeida, J., Dabu, M., Manikutty, A., and Cao, P. 1998. Providing differentiated quality-of-service in Web hosting services. In Proceedings of the First Workshop on Internet Server Performance.Google ScholarGoogle Scholar
  2. Almesberger, W. 1999. Linux network traffic control---implementation overview. White paper available at http://diffserv.sourceforge.net/.Google ScholarGoogle Scholar
  3. Almesberger, W., Salim, J. H., and Kuznetsov, A. 1999. Differentiated services on Linux. White paper available at http://lrcwww.epfl.ch/linux-diffserv/.Google ScholarGoogle Scholar
  4. Apache. 2001. Apache web server. http://httpd.apache.org.Google ScholarGoogle Scholar
  5. Arlitt, M., Friedrich, R., and Jin, T. 1999. Workload characterization of a web proxy in a cable modem environment. ACM Perform. Eval. Rev. 27, 2 (August), 25--36. Google ScholarGoogle Scholar
  6. Banga, G. and Druschel, P. 1999. Measuring the capacity of a web server under realistic loads. World Wide Web 2, 1--2, 69--83. Google ScholarGoogle Scholar
  7. Banga, G., Druschel, P., and Mogul, J. 1998. Better operating system features for faster network servers. ACM SIGMETRICS Performance Evaluation Review 26, 3, 23--30. Google ScholarGoogle Scholar
  8. Bansal, N. and Harchol-Balter, M. 2001. Analysis of SRPT scheduling: Investigating unfairness. In Proceedings of ACM SIGMETRICS '01. 279--290. Google ScholarGoogle Scholar
  9. Barford, P. and Crovella, M. E. 1998. Generating representative Web workloads for network and server performance evaluation. In Proceedings of SIGMETRICS '98. 151--160. Google ScholarGoogle Scholar
  10. Bender, M., Chakrabarti, S., and Muthukrishnan, S. 1998. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. Google ScholarGoogle Scholar
  11. Bestavros, A., Carter, R. L., Crovella, M. E., Cunha, C. R., Heddaya, A., and Mirdad, S. A. 1995. Application-level document caching in the Internet. In Proceedings of the Second International Workshop on Services in Distributed and Networked Environments (SDNE'95). Google ScholarGoogle Scholar
  12. Braun, H. and Claffy, K. 1994. Web traffic characterization: an assessment of the impact of caching documents from NCSA's Web server. In Proceedings of the Second International WWW Conference.Google ScholarGoogle Scholar
  13. Cockcroft, A. 1996. Watching your web server. The Unix Insider at http://www.unixinsider.com.Google ScholarGoogle Scholar
  14. Crovella, M. and Bestavros, A. 1997. Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Trans. Netw. 5, 6 (December), 835--846. Google ScholarGoogle Scholar
  15. Crovella, M., Frangioso, R., and Harchol-Balter, M. 1999. Connection scheduling in web servers. In USENIX Symposium on Internet Technologies and Systems. Google ScholarGoogle Scholar
  16. Crovella, M., Taqqu, M. S., and Bestavros, A. 1998. Heavy-tailed probability distributions in the World Wide Web. In A Practical Guide To Heavy Tails. Chapman & Hall, New York, 3--26. Google ScholarGoogle Scholar
  17. Downey, A. B. 1997. A parallel workload model and its implications for processor allocation. In Proceedings of High Performance Distributed Computing. 112--123. Google ScholarGoogle Scholar
  18. Druschel, P. and Banga, G. 1996. Lazy receiver processing (LRP): A network subsystem architecture for server systems. In Proceedings of OSDI '96. 261--275. Google ScholarGoogle Scholar
  19. Feldmann, A.1999. Web performance characteristics. IETF plenary Nov. http://www.research. att.com/∼anja/feldmann/papers.html.Google ScholarGoogle Scholar
  20. Gwertzman, J. and Seltzer, M. 1994. The case for geographical push-caching. In Proceedings of HotOS '94. Google ScholarGoogle Scholar
  21. Harchol-Balter, M. and Downey, A. 1997. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Comput. Syst. 15, 3, 253--285. Google ScholarGoogle Scholar
  22. Harchol-Balter, M., Schroeder, B., Bansal, N., and Agrawal, M. 2000. Implementation of SRPT scheduling in web servers. Tech. Rep. CMU-CS-00-170.Google ScholarGoogle Scholar
  23. ITA. 2002. The internet traffic archives. Available at http://town.hall.org/Archives/pub/ITA/.Google ScholarGoogle Scholar
  24. Kaashoek, M., Engler, D., Wallach, D., and Ganger, G. 1996. Server operating systems. In SIGOPS European Workshop '96. 141--148. Google ScholarGoogle Scholar
  25. Krishnamurthy, B. and Rexford, J. 2001. Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement. Addison-Wesley. Google ScholarGoogle Scholar
  26. Little, J. 1961. A proof of the theorem L = λW. Operations Research 9, 383--387.Google ScholarGoogle Scholar
  27. Maggs, B. 2001. Personal communication with Vice President of Research, Akamai Technologies, Bruce Maggs.Google ScholarGoogle Scholar
  28. Manley, S. and Seltzer, M. 1997. Web facts and fantasy. In Proceedings of the 1997 USITS. Google ScholarGoogle Scholar
  29. Microsoft. 2001. The arts and science of Web server tuning with internet information services 5.0. Microsoft TechNet---Insights and Answers for IT Professionals: At http://www.microsoft. com/technet/.Google ScholarGoogle Scholar
  30. Mogul, J. C. 1995. Network behavior of a busy Web server and its clients. Tech. Rep. 95/5, Digital Western Research Laboratory. October.Google ScholarGoogle Scholar
  31. NISTNet. 2002. National institute of standards and technology. http://snad.ncsl.nist.gov/itg/nistnet/.Google ScholarGoogle Scholar
  32. Padmanabhan, V. N. and Mogul, J. 1995. Improving HTTP latency. Comput. Netw. ISDN Syst. 28, 25--35. Google ScholarGoogle Scholar
  33. Pai, V. S., Druschel, P., and Zwaenepoel, W. 1999. Flash: An efficient and portable Web server. In Proceedings of USENIX 1999. Google ScholarGoogle Scholar
  34. Radhakrishnan, S. 1999. Linux---advanced networking overview version 1. Available at http://qos.ittc.ukans.edu/howto/.Google ScholarGoogle Scholar
  35. Rizzo, L. 1997. Dummynet: a simple approach to the evaluation of network protocols. ACM Comput. Commun. Rev. 27, 1. Google ScholarGoogle Scholar
  36. Roberts, J. and Massoulie, L. 1998. Bandwidth sharing and admission control for elastic traffic. In ITC Specialist Seminar.Google ScholarGoogle Scholar
  37. Schrage, L. E. and Miller, L. W. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14, 670--684.Google ScholarGoogle Scholar
  38. Silberschatz, A., Galvin, P., and Gagne, G. 2002. Operating System Concepts, Sixth Edition. John Wiley & Sons. Google ScholarGoogle Scholar
  39. Stallings, W. 2001. Operating Systems, Fourth Edition. Prentice Hall.Google ScholarGoogle Scholar

Index Terms

  1. Size-based scheduling to improve web performance

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader