TY - JOUR
T1 - A scalable low-latency cache invalidation strategy for mobile environments
AU - Cao, Guohong
N1 - Funding Information:
The author would like to thank the anonymous referees whose insightful comments helped to improve the presentation of the paper. A preliminary version of the paper appeared in the Proceedings of the International Conference on Mobile Computing and Networking (MobiCom), August 2000. This work was supported in part by the US National Science Foundation CAREER Award CCR-0092770.
PY - 2003/9
Y1 - 2003/9
N2 - Caching frequently accessed data items on the client side is an effective technique for improving performance in a mobile environment. Classical cache invalidation strategies are not suitable for mobile environments due to frequent disconnections and mobility of the clients. One attractive cache invalidation technique is based on invalidation reports (IRs). However, the IR-based cache invalidation solution has two major drawbacks, which have not been addressed in previous research. First, there is a-long query latency associated with this solution since a client cannot answer the query until the next IR interval. Second, when the server updates a hot data item, all clients have to query the server and get the data from the server separately, which wastes a large amount of bandwidth. In this paper, we propose an IR-based cache invalidation algorithm, which can significantly reduce the query latency and efficiently utilize the broadcast bandwidth. Detailed analytical analysis and simulation experiments are carried out to evaluate the proposed methodology. Compared to previous IR-based schemes, our scheme can significantly improve the throughput and reduce the query latency, the number of uplink request, and the broadcast bandwidth requirements.
AB - Caching frequently accessed data items on the client side is an effective technique for improving performance in a mobile environment. Classical cache invalidation strategies are not suitable for mobile environments due to frequent disconnections and mobility of the clients. One attractive cache invalidation technique is based on invalidation reports (IRs). However, the IR-based cache invalidation solution has two major drawbacks, which have not been addressed in previous research. First, there is a-long query latency associated with this solution since a client cannot answer the query until the next IR interval. Second, when the server updates a hot data item, all clients have to query the server and get the data from the server separately, which wastes a large amount of bandwidth. In this paper, we propose an IR-based cache invalidation algorithm, which can significantly reduce the query latency and efficiently utilize the broadcast bandwidth. Detailed analytical analysis and simulation experiments are carried out to evaluate the proposed methodology. Compared to previous IR-based schemes, our scheme can significantly improve the throughput and reduce the query latency, the number of uplink request, and the broadcast bandwidth requirements.
UR - http://www.scopus.com/inward/record.url?scp=0141836810&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0141836810&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2003.1232276
DO - 10.1109/TKDE.2003.1232276
M3 - Article
AN - SCOPUS:0141836810
SN - 1041-4347
VL - 15
SP - 1251
EP - 1265
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 5
ER -