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. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Spanoudakis, M., Lorentzos, D., Anagnostopoulos, C., & Hadjiefthymiades, S. (2012). On the use of optimal stopping theory for improving cache consistency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7651 LNCS, pp. 87–99). https://doi.org/10.1007/978-3-642-35063-4_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
