Skip to main content

Experimental Analysis of the Correlation of HTTP GET Invocations

  • Conference paper
Formal Methods and Stochastic Models for Performance Evaluation (EPEW 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4054))

Included in the following conference series:

Abstract

In this paper we experimentally investigate if optimal retry times can be determined based on models that assume independence of successive tries. We do this using data obtained for HTTP GET. This data provides application-perceived timing characteristics for the various phases of web page download, including response times for TCP connection set-ups and individual object downloads. The data consists of pairs of consecutive downloads for over one thousand randomly chosen URLs. Our analysis shows that correlation exists for normally completed invocations, but is remarkably low for relatively slow downloads. This implies that for typical situations in which retries are applied, models relying on the independence assumption are appropriate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. The data discussed in this paper is available from the web site, http://homepages.cs.ncl.ac.uk/aad.vanmoorsel/data

  2. Alt, H., Guibas, L., Mehlhorn, K., Karp, R., Wigderson, A.: A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5), 543–547 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Donelson Smith, F., Hernandez Campos, F., Jeffay, K., Ott, D.: What TCP/IP Protocol Headers Can tell Us About The Web. SIGMETRICS, pp. 245–256 (2001)

    Google Scholar 

  4. Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: Israel Symposium on Theory of Computing Systems, pp. 128–133 (1993)

    Google Scholar 

  5. Maurer, S.M., Huberman, B.A.: Restart strategies and Internet congestion. Journal of Economic Dynamics and Control 25, 641–654 (2001)

    Article  MATH  Google Scholar 

  6. 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. 3335, pp. 86–100. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. 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. 2470. Springer, Heidelberg (2002)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. van Moorsel, A., Wolter, K.: Analysis and Algorithms for Restart. In: Proceedings of International Conference on Quantitative Evaluation of Systems, Twente, Netherlands, pp. 195–204 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reinecke, P., van Moorsel, A.P.A., Wolter, K. (2006). Experimental Analysis of the Correlation of HTTP GET Invocations. In: Horváth, A., Telek, M. (eds) Formal Methods and Stochastic Models for Performance Evaluation. EPEW 2006. Lecture Notes in Computer Science, vol 4054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11777830_16

Download citation

  • DOI: https://doi.org/10.1007/11777830_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35362-1

  • Online ISBN: 978-3-540-35365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics