Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Bit-sequences: an adaptive cache invalidation method in mobile client/server environments
Mobile Networks and Applications
An Evaluation of Cache Invalidation Strategies in Wireless Environments
IEEE Transactions on Parallel and Distributed Systems
A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment
IEEE Transactions on Parallel and Distributed Systems
On improving the performance of cache invalidation in mobile environments
Mobile Networks and Applications
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Disseminating Updates on Broadcast Disks
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Relaxed currency and consistency: how to say "good enough" in SQL
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems
Mobile Networks and Applications
On semantic caching and query scheduling for mobile nearest-neighbor search
Wireless Networks - Special issue: Pervasive computing and communications
Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
The use of periodic invalidation reports (IRs), has been shown to be a useful technique for conserving wireless bandwidth and battery power. However, IR-based schemes have some drawbacks, such as long query delay and low client caching availability, even if the clients have sufficient local cache capacity. In this paper, we propose an efficient cache access protocol to address these problems. Instead of passively waiting, the clients use the local cache actively. Using our protocol, we can remove the ”false alarm” that causes unnecessary delay. Based on our threshold-based scheme, the proposed protocol can optimize response time with little loss of data currency. Our simulation results are carried out to evaluate the proposed methodology. Compared to previous IR-based schemes, our scheme can reduce the response time significantly with a very little loss of data currency.