{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T16:02:12Z","timestamp":1746806532745,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540353621"},{"type":"electronic","value":"9783540353652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11777830_16","type":"book-chapter","created":{"date-parts":[[2006,6,19]],"date-time":"2006-06-19T11:21:04Z","timestamp":1150716064000},"page":"226-237","source":"Crossref","is-referenced-by-count":8,"title":["Experimental Analysis of the Correlation of HTTP GET Invocations"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Reinecke","sequence":"first","affiliation":[]},{"given":"Aad P. A.","family":"van Moorsel","sequence":"additional","affiliation":[]},{"given":"Katinka","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"The data discussed in this paper is available from the web site, http:\/\/homepages.cs.ncl.ac.uk\/aad.vanmoorsel\/data"},{"issue":"4\/5","key":"16_CR2","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/BF01940879","volume":"16","author":"H. Alt","year":"1996","unstructured":"Alt, H., Guibas, L., Mehlhorn, K., Karp, R., Wigderson, A.: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica\u00a016(4\/5), 543\u2013547 (1996)","journal-title":"Algorithmica"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Donelson Smith, F., Hernandez Campos, F., Jeffay, K., Ott, D.: What TCP\/IP Protocol Headers Can tell Us About The Web. SIGMETRICS, pp.\u00a0245\u2013256 (2001)","DOI":"10.1145\/384268.378789"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: Israel Symposium on Theory of Computing Systems, pp. 128\u2013133 (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/S0165-1889(00)00040-3","volume":"25","author":"S.M. Maurer","year":"2001","unstructured":"Maurer, S.M., Huberman, B.A.: Restart strategies and Internet congestion. Journal of Economic Dynamics and Control\u00a025, 641\u2013654 (2001)","journal-title":"Journal of Economic Dynamics and Control"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-30225-4_7","volume-title":"Service Availability","author":"P. Reinecke","year":"2005","unstructured":"Reinecke, P., van Moorsel, A., Wolter, K.: A Measurement Study of the Interplay between Application Level Restart and Transport Protocol. In: Malek, M., Reitenspiess, M., Kaiser, J. (eds.) ISAS 2004. LNCS, vol.\u00a03335, pp. 86\u2013100. Springer, Heidelberg (2005)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"Y. Ruan","year":"2002","unstructured":"Ruan, Y., Horvitz, E., Kautz, H.: Restart Policies with Dependence among Runs: A Dynamic Programming Approach. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470. Springer, Heidelberg (2002)"},{"key":"16_CR8","volume-title":"Proceedings of the Workshop on Infrastructure for Agents, MAS, and Scalable MAS at the Conference Autonomous Agents 2001","author":"M. Schroeder","year":"2001","unstructured":"Schroeder, M., Boro, L.: Does the Restart Method Work? Preliminary Results on Efficiency Improvements for Interactions of Web-Agents. In: Wagner, T., Rana, O. (eds.) Proceedings of the Workshop on Infrastructure for Agents, MAS, and Scalable MAS at the Conference Autonomous Agents 2001. Springer, Heidelberg (2001)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"van Moorsel, A., Wolter, K.: Analysis and Algorithms for Restart. In: Proceedings of International Conference on Quantitative Evaluation of Systems, Twente, Netherlands, pp. 195\u2013204 (2004)","DOI":"10.1109\/QEST.2004.1348034"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Stochastic Models for Performance Evaluation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11777830_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T08:23:40Z","timestamp":1555662220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11777830_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540353621","9783540353652"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11777830_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}