On the Use of Optimal Stopping Theory for Cache Consistency Checks

Spanoudakis, M., Lorentzos, D., Anagnostopoulos, C. and Hadjiefthymiades, S. (2012) On the Use of Optimal Stopping Theory for Cache Consistency Checks. In: 16th Panhellenic Conference on Informatics (PCI 2012), Piraeus, Greece, 5-7 Oct 2012, pp. 327-332. ISBN 9781467327206 (doi: 10.1109/PCi.2012.71)

Full text not currently available from Enlighten.


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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Anagnostopoulos, Dr Christos
Authors: Spanoudakis, M., Lorentzos, D., Anagnostopoulos, C., and Hadjiefthymiades, S.
Subjects:Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
College/School:College of Science and Engineering > School of Computing Science
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record