Online feedback-based estimation of dynamic page service time
Abstract
We present a framework for estimating the service time of a dynamic HTTP request by using the service times of past requests to the same URL. Our framework tags incoming requests with a timestamp. As the request is processed, server state relevant to the estimation mechanism, such as the number of threads servicing incoming requests, is stored with each request. When a request is handled, it is timestamped again, allowing us to calculate its service time. This service time is added to the history table and used in the computation of future estimates. The estimators we evaluated do not produce accurate predictions when server resources change, leaving room for further work in estimator design.
References
[1]
{1} Tarek F. Abdelzaher and Nina Bhatti. Web content adaptation to improve server overload behavior. In WWW '99: Proceeding of the eighth international conference on World Wide Web, pages 1563-1577, New York, NY, USA, 1999. Elsevier North-Holland, Inc.
[2]
{2} Nikhil Bansal and Mor Harchol-Balter. Analysis of srpt scheduling: investigating unfairness. In SIGMETRICS '01: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, pages 279-290, New York, NY, USA, 2001. ACM Press.
[3]
{3} Paul Barford and Mark Crovella. Generating representative web workloads for network and server performance evaluation. In SIGMETRICS '98/PERFORMANCE '98: Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, pages 151-160, New York, NY, USA, 1998. ACM Press.
[4]
{4} Azer Bestavros. Using speculation to reduce server load and service time on the www. Technical report, Boston, MA, USA, 1995.
[5]
{5} Hani Jamjoom. Network Oriented Controls of Internet Services. PhD thesis, University of Michigan, Electrical Engineering & Computer Science, 2004.
[6]
{6} Dan Kegel. The c10k problem. http://www.kegel.com/c10k.html, 1999.
[7]
{7} Jan Kneschke. Lighttpd. http://www.lighttpd.net, 2005.
[8]
{8} Hewlett-Packard Labs. Data center architecture. http://www.hpl.hp.com/research/dac/index.html, 2006.
[9]
{9} David Mosberger and Tai Jin. httperf--a tool for measuring web server performance. SIGMETRICS Perform. Eval. Rev., 26(3):31-37, 1998.
[10]
{10} Vivek S. Pai, Peter Druschel, and Willy Zwaenepoel. Flash: An efficient and portable Web server. In Proceedings of the USENIX 1999 Annual Technical Conference, 1999.
[11]
{11} Felix von Leitner. Scalable network programming or: The quest for a good web server (that survives slashdot). http://bulk.fefe.de/scalable-networking.pdf. 2003.
[12]
{12} Matt Welsh and David Culler. Adaptive overload control for busy internet servers. 2003.
[13]
{13} Matt Welsh, David Culler, and Eric Brewer. Seda: an architecture for well-conditioned, scalable internet services. In SOSP '01: Proceedings of the eighteenth ACM symposium on Operating systems principles, pages 230-243, New York, NY, USA, 2001. ACM Press.
Index Terms
- Online feedback-based estimation of dynamic page service time
Recommendations
Improving the service time of web clients using server redirection
This paper describes and evaluates experimentally a web server infrastructure, which consists of a small number of servers that redirect client requests based on the estimated client service time. The web servers have replicated content, are located in ...
Online Client Assignment in Dynamic Real-Time Distributed Interactive Applications
DS-RT '13: Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time ApplicationsQuality of user experience in Distributed Interactive Applications(DIAs) highly depends on the network latencies during the system execution. In DIAs, each user is assigned to a server and communication with any other client is performed through its ...
Semantics-based dynamic service composition
Complex services may be dynamically composed through combining distributed components on demand (i.e., when requested by a user) in order to provide new services without preinstallation. Several systems have been proposed to dynamically compose ...
Comments
Information & Contributors
Information
Published In
Copyright © 2006 Authors.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 2006
Published in SIGBED Volume 3, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 99Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in