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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rabinovich, M., Spatscheck, O.: Web Caching and Replication. Addison Wesley (2001)
Ferguson, T.: Optimal Stopping and Applications. Mathematics Department UCLA, http://www.math.ucla.edu/~tom/Stopping/Contents.html
Bruss, F.: A note on the odds theorem of optimal stopping. Ann. Probab. 31(4), 1859–1861 (2003)
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)
Gwertzman, J., Seltzer, M.: World-Wide Web Cache Consistency. In: Proc. of the Usenix Technical Conference, ATEC 1996 (January 1996)
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)
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)
Peskir, G., Shiryaev, A.: Optimal Stopping and Free Boundary Problems. ETH Zürich, Birkhauser (2006)
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)
Tamaki, M.: An optimal parking problem. Journal of Applied Probability 19(4), 803–814 (1982)
Shiryaev, A.: Optimal Stopping Rules. Springer, New York (1978)
Bruss, F.T.: Sum the odds to one and stop. Annals of Probability 28(3), 1384–1391 (2000)
Bruss, F.T., Louchard, G.: The Odds-algorithm based on sequential updating and its performance. Advances in Applied Probability 41(1), 131–153 (2009)
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)
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)
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)
Huang, S., Liu, X., Ding, Z.: Opportunistic spectrum access in cognitive radio networks. In: Proc. of the IEEE INFOCOM, pp. 1427–1435 (2008)
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)
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)
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)
Freeman, P.R.: The Secretary Problem and Its Extensions: A Review. International Statistical Review 51(2), 189–206 (1983)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)