Skip to main content
SpringerLink
Log in

On the Use of Optimal Stopping Theory for Improving Cache Consistency

  • Conference paper
Web Information Systems Engineering - WISE 2012 (WISE 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7651))

Included in the following conference series:

  • 2491 Accesses

Abstract

Serving the most updated version of a resource with minimal networking overhead is always a challenge for WWW Caching; especially, for weak consistency algorithms such as the widely adopted Adaptive Time-to-Live (ATTL). We adopt the Optimal Stopping Theory (OST) and, specifically, the Odds-algorithm, to enable the caching server to accurately handle the object refreshing and the stale delivery problem. Simulation results show that the proposed OST-based algorithm outperforms the conventional ATTL.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rabinovich, M., Spatscheck, O.: Web Caching and Replication. Addison Wesley (2001)

    Google Scholar 

  2. Ferguson, T.: Optimal Stopping and Applications. Mathematics Department UCLA, http://www.math.ucla.edu/~tom/Stopping/Contents.html

  3. Bruss, F.: A note on the odds theorem of optimal stopping. Ann. Probab. 31(4), 1859–1861 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  4. Lee, J., Whang, K.-Y., Lee, B.S., Chang, J.-W.: An Update-Risk Based Approach to TTL Estimation in Web Caching. In: Proc. 3rd IEEE Intl., Conf. Web Information Systems Engineering (WISE 2002), pp. 21–29 (2002)

    Google Scholar 

  5. Gwertzman, J., Seltzer, M.: World-Wide Web Cache Consistency. In: Proc. of the Usenix Technical Conference, ATEC 1996 (January 1996)

    Google Scholar 

  6. Chankhunthod, A., Danzig, P.B., Neerdaels, C., Schwartz, M.F., Worrell, K.J.: A Hierarchical internet object cache. In: Proc. of the Annual Conference on USENIX Annual Technical Conference, ATEC 1996 (January 1996)

    Google Scholar 

  7. Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like dis-tributions: Evidence and implications. In: Proc. of the IEEE INFOCOM (1), 126–134 (1999)

    Google Scholar 

  8. Peskir, G., Shiryaev, A.: Optimal Stopping and Free Boundary Problems. ETH Zürich, Birkhauser (2006)

    Google Scholar 

  9. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: Proc. of 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 1245–1254 (2009)

    Google Scholar 

  10. Tamaki, M.: An optimal parking problem. Journal of Applied Probability 19(4), 803–814 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Shiryaev, A.: Optimal Stopping Rules. Springer, New York (1978)

    MATH  Google Scholar 

  12. Bruss, F.T.: Sum the odds to one and stop. Annals of Probability 28(3), 1384–1391 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Bruss, F.T., Louchard, G.: The Odds-algorithm based on sequential updating and its performance. Advances in Applied Probability 41(1), 131–153 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Poulakis, M., Vassaki, S., Hadjiefthymiades, S.: Proactive radio resource management using optimal stopping theory. In: Proc. of IEEE Intl. Symposium on World of Wireless, Mobile and Multimedia Networks & Workshops, pp. 1–6 (2009)

    Google Scholar 

  15. Zheng, D., Ge, W., Zhang, J.: Distributed opportunistic scheduling for ad-hoc com-munications: an optimal stopping approach. In: Proc. of 8th ACM Intl. Symposium on Mobile Ad Hoc Networking and Computing, pp. 1–10 (2007)

    Google Scholar 

  16. Liu, C., Wu, J.: An optimal probabilistic forwarding protocol in delay tolerant net-works. In: Proc. of 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 105–114 (2009)

    Google Scholar 

  17. Huang, S., Liu, X., Ding, Z.: Opportunistic spectrum access in cognitive radio networks. In: Proc. of the IEEE INFOCOM, pp. 1427–1435 (2008)

    Google Scholar 

  18. Chen, J., Gerla, M., Lee, Y.Z., Sanadidi, M.Y.: TCP with delayed ack for wireless networks. Ad Hoc Networks 6(7), 1098–1116 (2008)

    Article  Google Scholar 

  19. Anagnostopoulos, C., Hadjiefthymiades, S.: Delay-tolerant delivery of quality information in ad hoc networks. Journal of Parallel and Distributed Computing 71(7), 974–987 (2011)

    Article  MATH  Google Scholar 

  20. Anagnostopoulos, C., Hadjiefthymiades, S.: Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks. Journal of Parallel and Distributed Computing 72(10), 1269–1279 (2012)

    Article  MATH  Google Scholar 

  21. Freeman, P.R.: The Secretary Problem and Its Extensions: A Review. International Statistical Review 51(2), 189–206 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  22. Barford, P., Crovella, M.: Generating Representative Web Workloads for Network and Server Performance Evaluation. In: Proc. of the ACM SIGMETRICS, pp. 151–160 (July 1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informatics & Telecommunications, National and Kapodistrian University of Athens, Athens, Greece

    Manos Spanoudakis & Stathes Hadjiefthymiades

  2. Dept. of Informatics, Hellenic Open University, Patras, Greece

    Dimitris Lorentzos

  3. Dept. of Informatics, Ionian University, Corfu, Greece

    Christos Anagnostopoulos

Authors
  1. Manos Spanoudakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitris Lorentzos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christos Anagnostopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stathes Hadjiefthymiades
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Fudan University, 825 Zhangheng Rd., Shanghai, 201203, China

    X. Sean Wang

  2. Department of Computer Science, College of Engineering, Science and Engineering Offices, The University of Illinois at Chicago, 851 South Morgan Street (M/C 152), 60607-7053, Chicago, Illinois, USA

    Isabel Cruz

  3. Department of Informatics and Telecommunications, University of Athens, GR15784, Ilisia, Athens, Greece

    Alex Delis

  4. Centre for Applied Informatics, Victoria University, PO Box 14428, 8001, Melbourne, VIC, Australia

    Guangyan Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Spanoudakis, M., Lorentzos, D., Anagnostopoulos, C., Hadjiefthymiades, S. (2012). On the Use of Optimal Stopping Theory for Improving Cache Consistency. In: Wang, X.S., Cruz, I., Delis, A., Huang, G. (eds) Web Information Systems Engineering - WISE 2012. WISE 2012. Lecture Notes in Computer Science, vol 7651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35063-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35063-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35062-7

  • Online ISBN: 978-3-642-35063-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation