Abstract
The Shortest-Remaining-Response-Time (SRRT) policy has been proposed for scheduling static HTTP requests in web servers to reduce the mean response time. The SRRT prioritizes requests based on a combination of the current round-trip-time (RTT), TCP congestion window size (cwnd) and the size of what remains of the requested file. We compare SRRT to Shortest-Remaining-Processing-Time (SRPT) and Processor-Sharing (PS) policies. The SRRT shows the best improvement in the mean response time. SRRT gives an average improvement of about 7.5% over SRPT. This improvement comes at a negligible expense in response time for long requests. We found that under 100Mbps link, only 1.5% of long requests have longer response times than under PS. The longest request under SRRT has an increase in response time by a factor 1.7 over PS. For 10Mbps link, only 2.4% of requests are penalized, and SRRT increases the longest request time by a factor 2.2 over PS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
King, A.: Speed up your site: web site optimization, 1st edn. New Riders, Indiana (2003)
Nielsen, J.: The need for speed (1997), http://www.useit.com/alertbox/9703a.html
Kegel, D.: The C10K problem (2006), http://www.kegel.com/c10k.html
Crovella, M., Frangioso, R.: Connection scheduling in web servers. In: USENIX Symposium on Internet Technologies and Systems (1999)
Rawat, M., Kshemkayani, A.: SWIFT: Scheduling in web servers for fast response time. In: Second IEEE International Symposium on Network Computing and Applications (2003)
Jechlitschek, C., Gorinsky, S.: Fair Efficiency, or Low Average Delay without Starvation. Computer Communications and Networks (2007)
Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. ACM SIGMETRICS Performance Evaluation Review 29(1), 279–290 (2001)
Manley, S., Seltzer, M.: Web facts and fantasy. In: Proceedings of the 1997 USITS 1997 (1997)
Murta, C., Corlassoli, T.: Fastest connection first: A new scheduling policy for web servers. In: The 18th International Teletra#c Congress, ITC-18 (2003)
Schrage, L., Miller, L.: The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14(4), 670–684 (1966)
Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Operations Research 16(3), 678–690 (1968)
Smith, D.: A new proof of the optimality of the shortest remaining processing time discipline. Operations Research 26(1), 197–199 (1976)
Goerg, C.: Evaluation of the optimal SRPT strategy with overhead. IEEE Transactions on Communications 34, 338–344 (1986)
Harchol-Balter, M., Schroeder, B., Agrawal, M., Bansal, N.: Size-based scheduling to improve web performance. ACM Transactions on Computer Systems (TOCS) 21(2), 207–233 (2003)
Schroeder, B., Harchol-Balter, M.: Web servers under overload: How schedule can help. ACM TOIT 6(1), 20–52 (2006)
Gong, M., Williamson, C.: Quantifying the properties of SRPT scheduling. In: MASCOTS, pp. 126–135 (2003)
Friedman, E., Henderson, S.: Fairness and efficiency in web server protocols. In: ACM SIGMETRICS, pp. 229–237 (2003)
Lu, D., Sheng, H.: Effects and implications of file size/service time correlation on web server scheduling policies. In: MASCOTS, pp. 258–267 (2005)
Bansal, N.: On the average sojourn time under M/M/1 SRPT. ACM SIGMETRICS Performance Evaluation Review 31(2), 34–35 (2003)
Bansal, N., Gamarnik, D.: Handling load with less stress. Queueing Systems 54(1), 45–54 (2006)
Barford, P., Crovella, M.: Generating representative web workloads for network and server performance evaluation. In: ACM Joint International Conference on Measurement and Modeling of Computer Systems, pp. 151–160 (1998)
Linux Foundation.: Network Emulation (Netem) (2007), http://www.linux-foundation.org/en/Net:Netem
Karn, P., Partridge, C.: Improving round-trip time estimates in reliable transport protocols. ACM SIGCOMM Computer Communication Review 25(1), 66–74 (1995)
Jacobson, V.: Congestion avoidance and Control. ACM SIGCOMM Computer Communication Review 25(1), 157–187 (1995)
Network Services & Consulting Corporation.: Internet Traffic Report (2007), http://www.internettrafficcreport.com
Padhye, J., Firoiu, V., Towsley, D., Kurose, J.: Modeling tcp reno performance: A simple model and its empirical validation. IEEE/ACM Transactions on Networking (TON) 8(2), 133–145 (2000)
Sa’deh, A., Yahya, A.: Implementation of a new Scheduling Policy in Web Servers. WEBIST (1), 22–29 (2008)
Crovella, M., Taqqu, M., Bestavros, A.: Heavy-tailed probability distributions in the World Wide Web. In: A Practical Guide To Heavy Tails, pp. 3–26. Chapman & Hall, New York (1998)
IRCache Home.: The trace files (2004), http://www.ircache.net/Traces
Netcraft.: Internet monitoring company (2007), http://news.netcraft.com
Padmanabhan, V., Sripanidkulchai, K.: The Case for Cooperative Networking. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 178–190. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
AlSa’deh, A., Yahya, A.H. (2009). Shortest Remaining Response Time Scheduling for Improved Web Server Performance. In: Cordeiro, J., Hammoudi, S., Filipe, J. (eds) Web Information Systems and Technologies. WEBIST 2008. Lecture Notes in Business Information Processing, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01344-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-01344-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01343-0
Online ISBN: 978-3-642-01344-7
eBook Packages: Computer ScienceComputer Science (R0)