This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Callback with Two-Level Adaptation for Wireless Data Access
August 2006 (vol. 5 no. 8)
pp. 1087-1102
Yang Xiao, IEEE
Hui Chen, IEEE
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 [0, 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 0 and M. Define U{\hbox{-}}{\rm 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{\hbox{-}}{\rm 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] WAP Forum, “Wireless Application Protocol Architecture Specification,” technical report, WAP Forum, 1998.
[2] WAP Forum, “Wireless Application Protocol White Paper,” technical report, WAP Forum, 1999.
[3] WAP Forum, “Wireless Application Protocol V1.1 to V1.2,” technical report, WAP Forum, 1999.
[4] C.H. Rao , D.-F. Chang , and Y.-B. Lin , “iSMS: An Integration Platform for Short Message Service and IP Networks,” IEEE Network, vol. 15, no. 2, pp. 48-55, 2001.
[5] Y.-B. Lin , W.-R. Lai , and J.-J Chen , “Effects of Cache Mechanism on Wireless Data Access,” IEEE Trans. Wireless Comm., vol. 2, no. 6, pp. 1247-1258, Nov. 2003.
[6] WAP Forum, “Wireless Application Protocol Cache Model Specification,” technical report, WAP Forum, 1998.
[7] J. Yin , L. Alvisi , M. Dahlin , and C. Lin , “Volume Leases for Consistency in Large-Scale Systems,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 4, July/Aug. 1999.
[8] G. Cao , “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” Proc. ACM Mobicom, 2000.
[9] G. Cao , “Proactive Power-Aware Cache Management for Mobile Computing Systems,” IEEE Trans. Computers, vol. 51, no. 6, pp. 608-621, June 2002.
[10] L. Breslau , P. Cao , G. Phillips , and S. Shenker , “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM '99, pp. 126-134, Mar. 1999.
[11] S. Khanna and V. Liberatore , “On Broadcast Disk Paging,” SIAM J. Computing, vol. 29, no. 5, pp. 1683-1702, 2000.
[12] J. Yin , L. Alvisi , M. Dahlin , and C. Lin , “Volume Leases for Consistency in Large-Scale Systems,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 4, pp. 563-576, July/Aug. 1999.
[13] S.M. Ross , Stochastic Processes. New York: Wiley, 1996.
[14] Y.-B. Lin , “Reducing Location Update Cost in a PCS Network,” IEEE/ACM Trans. Networking, vol. 5, no. 1, pp. 25-33, Feb. 1997.
[15] Y. Xiao , “Optimal Location Management for Two-Tier PCS Networks,” Computer Comm., vol. 26, no. 10, pp. 1047-1055, June 2003.
[16] L. Berslau , P. Cao , L. Fan , G. Phillips , and S. Shenker , “Web Caching and Zipf-Like Distributions: Evidence and Implications,” Proc. IEEE INFOCOM, vol. 1, pp. 126-134, Mar. 1999.
[17] G.K. Zipf , “Relative Frequency as a Determinant of Phonetic Change,” reprinted from the Harvard Studies in Classical Philology, vol. XL, 1929.
[18] X. Du , “QoS Routing Based on Multi-Class Nodes for Mobile Ad Hoc Networks,” Elsevier J. Ad Hoc Networks, vols. 2/3, pp. 241-254, July 2004.
[19] H. Chen and Y. Xiao , “Cache Access and Replacement for Future Wireless Internet,” IEEE Comm. Magazine, pp. 113-123, May 2006.

Index Terms:
Adaptive, cache, callback, strong consistency, wireless data access.
Citation:
Yang Xiao, Hui Chen, "Optimal Callback with Two-Level Adaptation for Wireless Data Access," IEEE Transactions on Mobile Computing, vol. 5, no. 8, pp. 1087-1102, Aug. 2006, doi:10.1109/TMC.2006.119
Usage of this product signifies your acceptance of the Terms of Use.