Abstract
In wireless data networks such as the WAP systems, the cached data may be time-sensitive and strong consistency must be maintained (i.e., the data presented to the user at the WAP handset must be the same as that in the origin server). In this paper, we study the cached data access algorithms in such systems. Two caching algorithms are investigated. In Algorithm I, Pull-Each-Read , whenever a data access occurs, the client always asks the server whether the cached entry in the client is valid or not. In Algorithm II, Callback , the server always invalidates the cached entry in the client whenever an update occurs. Analytic models are proposed to evaluate the performance of these algorithms. Our studies show that Algorithm II outperforms Algorithm I if the data access rate is high and the access pattern is irregular. We also design an adaptive mechanism to effectively switch between the two algorithms to take advantages of both algorithms. We also apply the single-level cached data access algorithms for the multi-level cache hierarchy. Our study indicates that with appropriate arrangement, strongly consistent cached data access for wireless Internet (such as WAP) can be efficiently supported. [PUBLICATION ABSTRACT]