A generalized target-driven cache replacement policy for mobile environments

Liangzhong Yin, Guohong Cao, Ying Cai

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Many existing cache replacement algorithms employ a value function of different factors such as time since last access, entry time of the item in the cache, transfer time, item expiration time and so on. However, most of the existing algorithms are designed for WWW environment under weak consistency model. Their choices of value functions are based on experience and on a value function which only works for a specific performance metric. In this paper, we propose a generalized value function for cache replacement algorithms for wireless networks under a strong consistency model. The distinctive feature of our value function is that it is generalized and can be used for various performance metrics by making the necessary changes. Further, we prove that the proposed value function can optimize the access cost in our system model. To demonstrate the practical effectiveness of the generalized value function, we derive two specific functions and evaluate them by setting up two different targets: minimizing the query delay and minimizing the downlink traffic. Compared to previous schemes, our algorithm significantly improves the performance in terms of query delay or in terms of bandwidth utilization depending on the specified target.

Original languageEnglish (US)
Pages (from-to)583-594
Number of pages12
JournalJournal of Parallel and Distributed Computing
Volume65
Issue number5
DOIs
StatePublished - May 1 2005

Fingerprint

Replacement Policy
Value Function
Cache
Target
Replacement
Performance Metrics
Generalized Functions
Wireless Networks
Wireless networks
Query
Weak Consistency
Strong Consistency
Caching
Set theory
System Performance
World Wide Web
Bandwidth
Optimise
Traffic
Model

All Science Journal Classification (ASJC) codes

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

Cite this

@article{010d8a8d69ed44f7a0c42c8aac469e13,
title = "A generalized target-driven cache replacement policy for mobile environments",
abstract = "Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Many existing cache replacement algorithms employ a value function of different factors such as time since last access, entry time of the item in the cache, transfer time, item expiration time and so on. However, most of the existing algorithms are designed for WWW environment under weak consistency model. Their choices of value functions are based on experience and on a value function which only works for a specific performance metric. In this paper, we propose a generalized value function for cache replacement algorithms for wireless networks under a strong consistency model. The distinctive feature of our value function is that it is generalized and can be used for various performance metrics by making the necessary changes. Further, we prove that the proposed value function can optimize the access cost in our system model. To demonstrate the practical effectiveness of the generalized value function, we derive two specific functions and evaluate them by setting up two different targets: minimizing the query delay and minimizing the downlink traffic. Compared to previous schemes, our algorithm significantly improves the performance in terms of query delay or in terms of bandwidth utilization depending on the specified target.",
author = "Liangzhong Yin and Guohong Cao and Ying Cai",
year = "2005",
month = "5",
day = "1",
doi = "10.1016/j.jpdc.2004.12.002",
language = "English (US)",
volume = "65",
pages = "583--594",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "5",

}

A generalized target-driven cache replacement policy for mobile environments. / Yin, Liangzhong; Cao, Guohong; Cai, Ying.

In: Journal of Parallel and Distributed Computing, Vol. 65, No. 5, 01.05.2005, p. 583-594.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A generalized target-driven cache replacement policy for mobile environments

AU - Yin, Liangzhong

AU - Cao, Guohong

AU - Cai, Ying

PY - 2005/5/1

Y1 - 2005/5/1

N2 - Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Many existing cache replacement algorithms employ a value function of different factors such as time since last access, entry time of the item in the cache, transfer time, item expiration time and so on. However, most of the existing algorithms are designed for WWW environment under weak consistency model. Their choices of value functions are based on experience and on a value function which only works for a specific performance metric. In this paper, we propose a generalized value function for cache replacement algorithms for wireless networks under a strong consistency model. The distinctive feature of our value function is that it is generalized and can be used for various performance metrics by making the necessary changes. Further, we prove that the proposed value function can optimize the access cost in our system model. To demonstrate the practical effectiveness of the generalized value function, we derive two specific functions and evaluate them by setting up two different targets: minimizing the query delay and minimizing the downlink traffic. Compared to previous schemes, our algorithm significantly improves the performance in terms of query delay or in terms of bandwidth utilization depending on the specified target.

AB - Caching frequently accessed data items on the client side is an effective technique to improve the system performance in wireless networks. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Many existing cache replacement algorithms employ a value function of different factors such as time since last access, entry time of the item in the cache, transfer time, item expiration time and so on. However, most of the existing algorithms are designed for WWW environment under weak consistency model. Their choices of value functions are based on experience and on a value function which only works for a specific performance metric. In this paper, we propose a generalized value function for cache replacement algorithms for wireless networks under a strong consistency model. The distinctive feature of our value function is that it is generalized and can be used for various performance metrics by making the necessary changes. Further, we prove that the proposed value function can optimize the access cost in our system model. To demonstrate the practical effectiveness of the generalized value function, we derive two specific functions and evaluate them by setting up two different targets: minimizing the query delay and minimizing the downlink traffic. Compared to previous schemes, our algorithm significantly improves the performance in terms of query delay or in terms of bandwidth utilization depending on the specified target.

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

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

U2 - 10.1016/j.jpdc.2004.12.002

DO - 10.1016/j.jpdc.2004.12.002

M3 - Article

AN - SCOPUS:15844380268

VL - 65

SP - 583

EP - 594

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 5

ER -