About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICPP 2001
Conference paper
An optimal cache replacement policy for wireless data dissemination under cache consistency
Abstract
A good cache management method for mobile wireless environments has to handle problems associated with limited client resources and frequent client disconnections, in addition to standard problems found in wired environments, such as variable data sizes and data updates. In this paper we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely access probability, update frequency, data size, retrieval delay, and cache validation cost. Min-SAUD is optimal in terms of the stretch performance measure. Preliminary experimental results show that in most cases the Min-SAUD replacement policy substantially outperforms two existing policies, namely LRU and SAIU.