2012 16th Panhellenic Conference on Informatics (2012)
Piraeus, Greece Greece
Oct. 5, 2012 to Oct. 7, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCi.2012.71
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.
Servers, Informatics, Delay, Educational institutions, Random variables, Ad hoc networks, odds-algorithm, web cache consistency, optimal stopping theory
C. Anagnostopoulos, S. Hadjiefthymiades, M. Spanoudakis and D. Lorentzos, "On the Use of Optimal Stopping Theory for Cache Consistency Checks," 2012 16th Panhellenic Conference on Informatics(PCI), Piraeus, Greece Greece, 2012, pp. 327-332.