On the Use of Optimal Stopping Theory for Cache Consistency Checks

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.