Strongly consistent callback cache mechanisms have been studied for data access in wireless networks. In cache access mechanisms, update information is extremely important since an updated data object in a remote server makes the corresponding data objects invalidated in mobile terminals (MTs), and the data object cache hit information in those MTs becomes almost useless. In this paper, we propose an adaptive access mechanism, called optimal callback with two-level adaptation. In the first-level adaptation, cache size in an MT is adaptively adjusted based on update-to-access-ratio (UAR), defined as the average number of updates per data object access. The range of the cache size is [O, M], where M is the maximum physical cache size of the MT. Two extreme cases are given as follows: 1) when the UAR is very large so that objects in the cache are always obsolete, the cache should not be used and, therefore, the cache size should be set to zero; 2) when the UAR is zero so that every object in the cache is valid, the cache size should be set to M. Under other situations, the cache size is dynamically changed between O and M. Define U-threshold of the UAR for any object, a particular important threshold, as a UAR value, beyond which the object should be not cached at all. The idea of the second-level adaptation is that if an object size is small, sending back the object may be a better choice than sending back an invalidation message when the object is updated. Therefore, when an object is updated at the server, it is sent directly to MTs if the object size is smaller than a threshold, called push threshold (T); otherwise, an invalidation message is sent to the MTs. We analytically model cost function for the proposed adaptive scheme as the total traffic involved between the server and an MT per data object access, and the optimal cache size and the optimal T value are obtained simultaneously to minimize the cost function. Furthermore, U-threshold is derived analytically. Both simulations and analytical results are used to study and compare the performance of the proposed scheme with several others under many different scenarios
[1]
Sanjeev Khanna,et al.
On broadcast disk paging
,
1998,
STOC '98.
[2]
Michael Dahlin,et al.
Volume Leases for Consistency in Large-Scale Systems
,
1999,
IEEE Trans. Knowl. Data Eng..
[3]
A. Juret.
George Kingsley Zipf, Relative frequency as a determinant of phonetic change (Harvard Studies in Classical Philology, vol. XL), 1929
,
.
[4]
Yi-Bing Lin.
Reducing location update cost in a PCS network
,
1997,
TNET.
[5]
Yi-Bing Lin,et al.
Effects of cache mechanism on wireless data access
,
2003,
IEEE Trans. Wirel. Commun..
[6]
Guohong Cao,et al.
A scalable low-latency cache invalidation strategy for mobile environments
,
2000,
MobiCom '00.
[7]
Yang Xiao.
Optimal location management for two-tier PCS networks
,
2003,
Comput. Commun..
[8]
Sheldon M. Ross,et al.
Stochastic Processes
,
2018,
Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.
[9]
Xiaojiang Du,et al.
QoS routing based on multi-class nodes for mobile ad hoc networks
,
2004,
Ad Hoc Networks.
[10]
Yi-Bing Lin,et al.
iSMS: an integration platform for short message service and IP networks
,
2001
.
[11]
Yang Xiao,et al.
Cache access and replacement for future wireless Internet
,
2006,
IEEE Communications Magazine.
[12]
Li Fan,et al.
Web caching and Zipf-like distributions: evidence and implications
,
1999,
IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[13]
Guohong Cao,et al.
Proactive Power-Aware Cache Management for Mobile Computing Systems
,
2002,
IEEE Trans. Computers.
[14]
George Kingsley Zipf,et al.
Relative Frequency as a Determinant of Phonetic Change
,
1930
.