{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:09Z","timestamp":1750308009909,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1145\/1143489.1143492","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"7-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Online feedback-based estimation of dynamic page service time"],"prefix":"10.1145","volume":"3","author":[{"given":"Ashwini","family":"Kumar","sequence":"first","affiliation":[{"name":"EECS Department, University of Michigan"}]},{"given":"Kaushik","family":"Veeraraghavan","sequence":"additional","affiliation":[{"name":"EECS Department, University of Michigan"}]},{"given":"Benjamin","family":"Wester","sequence":"additional","affiliation":[{"name":"EECS Department, University of Michigan"}]},{"given":"Kang","family":"Shin","sequence":"additional","affiliation":[{"name":"EECS Department, University of Michigan"}]}],"member":"320","published-online":{"date-parts":[[2006,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1563","volume-title":"WWW '99: Proceeding of the eighth international conference on World Wide Web","author":"Tarek","year":"1999","unstructured":"{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. {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."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378792"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/277851.277897"},{"key":"e_1_2_1_4_1","volume-title":"USA","author":"Bestavros Azer","year":"1995","unstructured":"{4} Azer Bestavros . Using speculation to reduce server load and service time on the www. Technical report, Boston, MA , USA , 1995 . {4} Azer Bestavros. Using speculation to reduce server load and service time on the www. Technical report, Boston, MA, USA, 1995."},{"key":"e_1_2_1_6_1","unstructured":"{6} Dan Kegel. The c10k problem. http:\/\/www.kegel.com\/c10k.html 1999.  {6} Dan Kegel. The c10k problem. http:\/\/www.kegel.com\/c10k.html 1999."},{"key":"e_1_2_1_7_1","volume-title":"http:\/\/www.lighttpd.net","author":"Kneschke Jan","year":"2005","unstructured":"{7} Jan Kneschke . Lighttpd. http:\/\/www.lighttpd.net , 2005 . {7} Jan Kneschke. Lighttpd. http:\/\/www.lighttpd.net, 2005."},{"key":"e_1_2_1_8_1","unstructured":"{8} Hewlett-Packard Labs. Data center architecture. http:\/\/www.hpl.hp.com\/research\/dac\/index.html 2006.  {8} Hewlett-Packard Labs. Data center architecture. http:\/\/www.hpl.hp.com\/research\/dac\/index.html 2006."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/306225.306235"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the USENIX 1999 Annual Technical Conference","author":"Pai Vivek S.","year":"1999","unstructured":"{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 . {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."},{"key":"e_1_2_1_11_1","unstructured":"{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.  {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."},{"key":"e_1_2_1_12_1","volume-title":"Adaptive overload control for busy internet servers","author":"Welsh Matt","year":"2003","unstructured":"{12} Matt Welsh and David Culler . Adaptive overload control for busy internet servers . 2003 . {12} Matt Welsh and David Culler. Adaptive overload control for busy internet servers. 2003."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502057"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143489.1143492","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1143489.1143492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:34Z","timestamp":1750259194000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1143489.1143492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1145\/1143489.1143492"],"URL":"https:\/\/doi.org\/10.1145\/1143489.1143492","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2006,4]]},"assertion":[{"value":"2006-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}