Please use this identifier to cite or link to this item:
Title: Energy-efficient selective cache invalidation
Authors: Cai, J.
Tan, K.-L. 
Issue Date: 1999
Citation: Cai, J.,Tan, K.-L. (1999). Energy-efficient selective cache invalidation. Wireless Networks 5 (6) : 489-502. ScholarBank@NUS Repository.
Abstract: In a mobile environment, users of portable computers can query databases over the wireless communication channels. To reduce contention on the limited bandwidth of the wireless channels, frequently accessed data are cached at the mobile clients. However, maintenance of the cache consistency is complicated by the mobile clients' frequent disconnection to conserve energy. One promising approach in the literature is for the server to periodically broadcast invalidation reports from which clients can salvage their cache content that are still valid. This mechanism is, however, not energy efficient as clients are expected to examine the entire invalidation report. In this paper, we reexamine the cache coherency problem and propose three novel cache coherency schemes. While these schemes are based on periodic broadcast of invalidation reports, they allow clients to selectively tune to the portions of the invalidation report that are of interest to them. This allows the clients to minimize the power consumption when invalidating their cache content. We conducted extensive studies based on a simulation model. Our study shows that the proposed schemes are not only effective in salvaging the cache content that are still valid (and hence result in lower access time), but are also efficient in energy utilization. While none of the proposed algorithms is superior in both the access time and energy efficiency, one of the schemes, Selective Cache Invalidation, provides the best overall performance.
Source Title: Wireless Networks
ISSN: 10220038
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Aug 19, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.