On the use of optimal stopping theory for improving cache consistency

Authors:
Manos Spanoudakis;Dimitris Lorentzos;Christos Anagnostopoulos;Stathes Hadjiefthymiades
Affiliations:
Dept. of Informatics & Telecommunications, National and Kapodistrian University of Athens, Athens, Greece;Dept. of Informatics, Hellenic Open University, Patras, Greece;Dept. of Informatics, Ionian University, Corfu, Greece;Dept. of Informatics & Telecommunications, National and Kapodistrian University of Athens, Athens, Greece
Venue:
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Year:
2012

Citing 11
Cited 0

Generating representative Web workloads for network and server performance evaluation

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Web caching and replication

Web caching and replication
An Update-Risk Based Approach to TTL Estimation in Web Caching

WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
World-wide web cache consistency

ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
A hierarchical internet object cache

ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
TCP with delayed ack for wireless networks

Ad Hoc Networks
Secretary problems: weights and discounts

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An optimal probabilistic forwarding protocolin delay tolerant networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Delay-tolerant delivery of quality information in ad hoc networks

Journal of Parallel and Distributed Computing
Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.