ACM Home Page
Please provide us with feedback. Feedback
A scalable low-latency cache invalidation strategy for mobile environments
Full text PdfPdf (1.07 MB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 6th annual international conference on Mobile computing and networking table of contents
Boston, Massachusetts, United States
Pages: 200 - 209  
Year of Publication: 2000
ISBN:1-58113-197-6
Author
Guohong Cao  Department of Computer Science & Engineering, The Pennsylvania State University, University Park, PA
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
IEICE : Inst of Electronics, Info & Communication Engineers
IFIP WG 6.3 : IFIP WG 6.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 34,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/345910.345945
What is a DOI?

ABSTRACT

Caching frequently accessed data items on the client side is an effective technique to improve performance in a mobile environment. Classical cache invalidation strategies are not suitable for mobile environments due to the disconnection and mobility of the mobile 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 is 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 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
The editors of IEEE 802.11, "Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications," 802.11 Wireless Standards (http ://grouper. ieee.org/groups/8 02/11), 1999.
 
4
 
5
D.J. Goodman, "Cellular Packet Communication," IEEE ~ans. Communication, 38(8):1272-1280, Aug. 1990.
 
6
 
7
8
 
9
 
10
M. Kazar, "Synchronization and Caching Issues in the Andrew File System," USENIX Conf., pages 27-36, 1988.
 
11
 
12
R. Powers, "Batteries for Low Power Electronics," Proc. IEEE, 83(4):687-693, April 1995.
 
13
S. Sandberg, D. Goldberg, S. Kleiman, D. Walsh, and B. Lyon, "Design and Implementation of the Sun Network File System," Proc. USENIX Summer Conf., pages 119-130, June 1985.
 
14
 
15
 
16

CITED BY  14