On the effectiveness of a counter-based cache invalidation scheme and its resiliency to failures in mobile environments

Research output: Contribution to journalConference article

6 Citations (Scopus)

Abstract

Caching frequently accessed data items on the client side is an effective technique to improve the performance of data dissemination in mobile environments. 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, IR-based approach suffers from long query latency and it cannot efficiently utilize the broadcast bandwidth. In this paper, we propose techniques to address these problems. We first extend the UIR-based approach to reduce the query latency. Then, we propose techniques to efficiently utilize the broadcast bandwidth based on counters associated with each data item. Novel techniques are designed to maintain the accuracy of the counter in case of server failures, client failures, and disconnections. Extensive simulations are provided and used to evaluate the proposed methodology. Compared to previous IR-based algorithms, the proposed solution can significantly reduce the query latency, improve the bandwidth utilization, and effectively deal with disconnections and failures.

Original languageEnglish (US)
Pages (from-to)247-256
Number of pages10
JournalProceedings of the IEEE Symposium on Reliable Distributed Systems
StatePublished - Jan 1 2001
Event20th IEEE Symposium on Reliable Distributed Systems (SRDS 2001) - New Orleans, LA, United States
Duration: Oct 28 2001Oct 31 2001

Fingerprint

Resiliency
Cache
Bandwidth
Latency
Query
Broadcast
Servers
Data Dissemination
Caching
Server
Methodology
Evaluate
Simulation

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{f07955397ba6417ca15f5f0f25b02363,
title = "On the effectiveness of a counter-based cache invalidation scheme and its resiliency to failures in mobile environments",
abstract = "Caching frequently accessed data items on the client side is an effective technique to improve the performance of data dissemination in mobile environments. 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, IR-based approach suffers from long query latency and it cannot efficiently utilize the broadcast bandwidth. In this paper, we propose techniques to address these problems. We first extend the UIR-based approach to reduce the query latency. Then, we propose techniques to efficiently utilize the broadcast bandwidth based on counters associated with each data item. Novel techniques are designed to maintain the accuracy of the counter in case of server failures, client failures, and disconnections. Extensive simulations are provided and used to evaluate the proposed methodology. Compared to previous IR-based algorithms, the proposed solution can significantly reduce the query latency, improve the bandwidth utilization, and effectively deal with disconnections and failures.",
author = "G. Cao and C. Das",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
pages = "247--256",
journal = "Proceedings of the IEEE Symposium on Reliable Distributed Systems",
issn = "1060-9857",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - On the effectiveness of a counter-based cache invalidation scheme and its resiliency to failures in mobile environments

AU - Cao, G.

AU - Das, C.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - Caching frequently accessed data items on the client side is an effective technique to improve the performance of data dissemination in mobile environments. 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, IR-based approach suffers from long query latency and it cannot efficiently utilize the broadcast bandwidth. In this paper, we propose techniques to address these problems. We first extend the UIR-based approach to reduce the query latency. Then, we propose techniques to efficiently utilize the broadcast bandwidth based on counters associated with each data item. Novel techniques are designed to maintain the accuracy of the counter in case of server failures, client failures, and disconnections. Extensive simulations are provided and used to evaluate the proposed methodology. Compared to previous IR-based algorithms, the proposed solution can significantly reduce the query latency, improve the bandwidth utilization, and effectively deal with disconnections and failures.

AB - Caching frequently accessed data items on the client side is an effective technique to improve the performance of data dissemination in mobile environments. 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, IR-based approach suffers from long query latency and it cannot efficiently utilize the broadcast bandwidth. In this paper, we propose techniques to address these problems. We first extend the UIR-based approach to reduce the query latency. Then, we propose techniques to efficiently utilize the broadcast bandwidth based on counters associated with each data item. Novel techniques are designed to maintain the accuracy of the counter in case of server failures, client failures, and disconnections. Extensive simulations are provided and used to evaluate the proposed methodology. Compared to previous IR-based algorithms, the proposed solution can significantly reduce the query latency, improve the bandwidth utilization, and effectively deal with disconnections and failures.

UR - http://www.scopus.com/inward/record.url?scp=0035203712&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035203712&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0035203712

SP - 247

EP - 256

JO - Proceedings of the IEEE Symposium on Reliable Distributed Systems

JF - Proceedings of the IEEE Symposium on Reliable Distributed Systems

SN - 1060-9857

ER -