Measuring consistency in TTL-based caches

Authors:
Omri Bahat;Armand M. Makowski
Affiliations:
Department of Electrical and Computer Engineering, The Institute for Systems Research, University of Maryland, College Park, MD 20742, United States;Department of Electrical and Computer Engineering, The Institute for Systems Research, University of Maryland, College Park, MD 20742, United States
Venue:
Performance Evaluation - Performance 2005
Year:
2005

Citing 12
Cited 1

Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Maintaining Strong Cache Consistency in the World Wide Web

IEEE Transactions on Computers
Piggyback server invalidation for proxy cache coherency

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Timed consistency for shared distributed objects

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The content and access dynamics of a busy Web site: findings and implications

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Engineering web cache consistency

ACM Transactions on Internet Technology (TOIT)
Changes in Web client access patterns: Characteristics and caching implications

World Wide Web
A Generalized Target-Driven Cache Replacement Policy for Mobile Environments

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
Exploring the Benefits of a Continuous Consistency Model for Wireless Web Portals

WIAPP '01 Proceedings of the Second IEEE Workshop on Internet Applications (wiapp '01)
Consistency models for Internet caching

WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Study of piggyback cache validation for proxy caches in the world wide web

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
World-wide web cache consistency

ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference

A strongly consistent cached data access algorithm for wireless data networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a general modeling framework to evaluate the performance of cache consistency algorithms. In addition to the usual hit rate, we introduce the hit^* rate as a consistency measure, which captures the fraction of non-stale downloads from the cache. We apply these ideas to the analysis of the fixed TTL consistency algorithm in the presence of network delays. The hit and hit^* rates are evaluated when requests and updates are modeled by renewal processes. Classical results on the renewal function lead to various bounds.