This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Update-Based Cache Access and Replacement in Wireless Data Access
December 2006 (vol. 5 no. 12)
pp. 1734-1748
ASCII Text
x 
 
Hui Chen, Yang Xiao, Xuemin (Sherman) Shen, "Update-Based Cache Access and Replacement in Wireless Data Access," IEEE Transactions on Mobile Computing, vol. 5, no. 12, pp. 1734-1748, December, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2006.188,
author = {Hui Chen and Yang Xiao and Xuemin (Sherman) Shen},
title = {Update-Based Cache Access and Replacement in Wireless Data Access},
journal ={IEEE Transactions on Mobile Computing},
volume = {5},
number = {12},
issn = {1536-1233},
year = {2006},
pages = {1734-1748},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.188},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Update-Based Cache Access and Replacement in Wireless Data Access
IS - 12
SN - 1536-1233
SP1734
EP1748
EPD - 1734-1748
A1 - Hui Chen,
A1 - Yang Xiao,
A1 - Xuemin (Sherman) Shen,
PY - 2006
KW - Cache replacement policy
KW - access
KW - update
KW - wireless network.
VL - 5
JA - IEEE Transactions on Mobile Computing
ER -
 
Cache has been applied for wireless data access with different replacement policies in wireless networks. Most of the current cache replacement schemes are access-based replacement policies since they are based on object access frequency/recency information. Access-based replacement policies either ignore or do not focus on update information. However, update information is extremely important since it can make access information almost useless. In this paper, we consider two fundamental and strongly consistent access algorithms: Poll-Per-Read (PER) and Call-Back (CB). We propose a server-based PER (SB-PER) cache access mechanism in which the server makes replacement decisions and a client-based CB cache access mechanism in which clients make replacement decisions. Both mechanisms have been designed to be suitable for using both update frequency and access frequency. We further propose two update-based replacement policies, least access-to-update ratio (LA2U) and least access-to-update difference (LAUD). We provide a thorough performance analysis via extensive simulations for evaluating these algorithms in terms of access rate, update rate, cache size, database size, object size, etc. Our study shows that although effective hit ratio is a better metric than cache hit ratio, it is a worse metric than transmission cost, and a higher effective hit ratio does not always mean a lower cost. In addition, the proposed SB-PER mechanism is better than the original PER algorithm in terms of effective hit ratio and cost, and the update-based policies outperform access-based policies in most cases.

[1] S. Acharya and S. Muthukrishnan, “Scheduling On-Demand Broadcasts: New Metrics and Algorithms,” Proc. MobiCom, pp.43-54, 1998.
[2] D. Barbara and T. Imielinksi, “Sleepers and Workaholics: Caching Strategies for Mobile Environments,” Proc. ACM SIGMOD Conf. Management of Data, pp. 1-12, May 1994.
[3] D. Barbara and T. Imielinksi, “Sleepers and Workaholics: Caching Strategies for Mobile Environments (Extended Version),” VLDB J., vol. 4, no. 4, pp. 567-602, 1995.
[4] J. Cai and K.-L. Tan, “Energy-Efficient Selective Cache Invalidation,” Wireless Networks, vol. 5, no. 6, pp. 489-502, 1999.
[5] G. Cao, “Proactive Power-Aware Cache Management for Mobile Computing Systems,” IEEE Trans. Computers, vol. 51, no. 6, pp.608-621, June 2002.
[6] G. Cao, “A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, Sept./Oct. 2003.
[7] B.Y.L. Chan, A. Si, and H.V. Leong, “Cache Management for Mobile Databases: Design and Evaluation,” Proc. 14th Int'l Conf. Data Eng. (ICDE '98), pp. 54-63, Feb. 1998.
[8] C.C.F. Fong, J.C.S. Lui, and M.H. Wong, “Quantifying Complexity and Performance Gains of Distributed Caching in a Wireless Network Environment,” Proc. 13th Int'l Conf. Data Eng. (ICDE '97), pp. 104-113, Oct. 1997.
[9] J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West, “Scale and Performance in a Distributed File System,” ACM Trans. Computer Systems, vol. 6, no. 1, pp. 51-58, Feb. 1988.
[10] Q.L. Hu and D.L. Lee, “Cache Algorithms Based on Adaptive Invalidation Reports for Mobile Environments,” Cluster Computing, vol. 1, no. 1, pp. 39-48, Feb. 1998.
[11] J. Jing, A.K. Elmagarmid, A. Helal, and R. Alonso, “Bit-Sequences: A New Cache Invalidation Method in Mobile Environments,” Mobile Networks and Applications, vol. 2, no. 2, pp. 115-127, 1997.
[12] A. Kahol, S. Khurana, S.K.S. Gupta, and P.K. Srimani, “A Strategy to Manage Cache Consistency in a Distributed Mobile Wireless Environment,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 7, pp. 686-700, July 2001.
[13] 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. 1240-1246, 2003.
[14] M. Nelson, B. Welch, and J. Ousterhout, “Caching in the Sprite Network File System,” ACM Trans. Computer Systems, vol. 6, no. 1, pp. 134-154, Feb. 1988.
[15] J.T. Robinson and M.V. Devarakonda, “Data Cache Management Using Frequency-Based Replacement,” Proc. ACM Sigmetrics Conf., pp. 134-142, 1990.
[16] K.L. Tan, J. Cai, and B.C. Ooi, “An Evaluation of Cache Invalidation Strategies in Wireless Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 8, pp. 789-807, Aug. 2001.
[17] WAP Forum, “Wireless Application Protocol Architecture Specification,” technical report, WAP Forum, 2001.
[18] WAP Forum, “WAP Cache Operation Specification,” technical report, WAP Forum, 2001.
[19] WAP Forum, “User Agent Profiling Specification,” WAP Forum, 2001.
[20] K.-L. Wu, P.S. Yu, and M.-S. Chen, “Energy-Efficient Caching for Wireless Mobile Computing,” Proc. 12th Int'l Conf. Data Eng., pp.336-343, Feb. 1996.
[21] J. Xu, Q. Hu, D.L. Lee, and W.-C. Lee, “SAIU: An Efficient Cache Replacement Policy for Wireless On-Demand Broadcasts,” Proc. Ninth ACM Int'l Conf. Information and Knowledge Management (CIKM '00), pp. 46-53, Nov. 2000.
[22] J. Xu, Q. Hu, W.-C. Lee, and D.L. Lee, “Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 1, pp. 125-139, Jan. 2004.
[23] 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, Sept./Oct. 1999.
[24] J. Yuen, E. Chan, K.Y. Lam, and H.W. Leung, “Cache Invalidation Scheme for Mobile Computing Systems with Real-Time Data,” ACM SIGMOD Record, vol. 29, no. 4, pp. 34-39, 2000.

Index Terms:
Cache replacement policy, access, update, wireless network.
Citation:
Hui Chen, Yang Xiao, Xuemin (Sherman) Shen, "Update-Based Cache Access and Replacement in Wireless Data Access," IEEE Transactions on Mobile Computing, vol. 5, no. 12, pp. 1734-1748, Dec. 2006, doi:10.1109/TMC.2006.188
Usage of this product signifies your acceptance of the Terms of Use.