Please use this identifier to cite or link to this item:
|Title:||Organization of invalidation reports for energy-efficient cache invalidation in mobile environments|
|Citation:||Tan, K.-L. (2001). Organization of invalidation reports for energy-efficient cache invalidation in mobile environments. Mobile Networks and Applications 6 (3) : 279-290. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1011435018072|
|Abstract:||In a wireless environment, mobile clients often cache frequently accessed data to reduce contention on the limited wireless bandwidth. However, it is difficult for clients to ascertain the validity of their cache content because of their frequent disconnection. One promising cache invalidation approach is the Bit-Sequences scheme that organizes invalidation reports as a set of binary bit sequences with an associated set of timestamps. The report is periodically broadcast by the server to clients listening to the communication channel. While the approach has been shown to be effective, it is not energy efficient as clients are expected to examine the entire invalidation report. In this paper, we reexamine the Bit-Sequences method and study different organizations of the invalidation report to facilitate clients to selectively tune to the portion of the 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, compared to the Bit-Sequences approach, the proposed schemes are not only equally effective in salvaging the cache content but are more efficient in energy utilization.|
|Source Title:||Mobile Networks and Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 20, 2018
WEB OF SCIENCETM
checked on Apr 16, 2018
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.