An optimal cache replacement policy for wireless data dissemination under cache consistency

Jianliang Xu, Q. Hu, Wang-chien Lee, Dik Lun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

A good cache management method for mobile wireless environments has to handle problems associated with limited client resources and frequent client disconnections, in addition to standard problems found in wired environments, such as variable data sizes and data updates. In this paper we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely access probability, update frequency, data size, retrieval delay, and cache validation cost. Min-SAUD is optimal in terms of the stretch performance measure. Preliminary experimental results show that in most cases the Min-SAUD replacement policy substantially outperforms two existing policies, namely LRU and SAIU.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Parallel Processing, ICPP 2001
EditorsLionel M. Ni, Mateo Valero
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages267-274
Number of pages8
Volume2001-January
ISBN (Electronic)0769512577
DOIs
StatePublished - Jan 1 2001
EventInternational Conference on Parallel Processing, ICPP 2001 - Valencia, Spain
Duration: Sep 3 2001Sep 7 2001

Other

OtherInternational Conference on Parallel Processing, ICPP 2001
CountrySpain
CityValencia
Period9/3/019/7/01

Fingerprint

Data Dissemination
Replacement Policy
Cache
Update
Costs
Stretch
Performance Measures
Retrieval
Resources
Experimental Results

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Xu, J., Hu, Q., Lee, W., & Lee, D. L. (2001). An optimal cache replacement policy for wireless data dissemination under cache consistency. In L. M. Ni, & M. Valero (Eds.), Proceedings - International Conference on Parallel Processing, ICPP 2001 (Vol. 2001-January, pp. 267-274). [952071] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2001.952071
Xu, Jianliang ; Hu, Q. ; Lee, Wang-chien ; Lee, Dik Lun. / An optimal cache replacement policy for wireless data dissemination under cache consistency. Proceedings - International Conference on Parallel Processing, ICPP 2001. editor / Lionel M. Ni ; Mateo Valero. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. pp. 267-274
@inproceedings{9d61b45a9fff46009c39e740a0c3892e,
title = "An optimal cache replacement policy for wireless data dissemination under cache consistency",
abstract = "A good cache management method for mobile wireless environments has to handle problems associated with limited client resources and frequent client disconnections, in addition to standard problems found in wired environments, such as variable data sizes and data updates. In this paper we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely access probability, update frequency, data size, retrieval delay, and cache validation cost. Min-SAUD is optimal in terms of the stretch performance measure. Preliminary experimental results show that in most cases the Min-SAUD replacement policy substantially outperforms two existing policies, namely LRU and SAIU.",
author = "Jianliang Xu and Q. Hu and Wang-chien Lee and Lee, {Dik Lun}",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ICPP.2001.952071",
language = "English (US)",
volume = "2001-January",
pages = "267--274",
editor = "Ni, {Lionel M.} and Mateo Valero",
booktitle = "Proceedings - International Conference on Parallel Processing, ICPP 2001",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Xu, J, Hu, Q, Lee, W & Lee, DL 2001, An optimal cache replacement policy for wireless data dissemination under cache consistency. in LM Ni & M Valero (eds), Proceedings - International Conference on Parallel Processing, ICPP 2001. vol. 2001-January, 952071, Institute of Electrical and Electronics Engineers Inc., pp. 267-274, International Conference on Parallel Processing, ICPP 2001, Valencia, Spain, 9/3/01. https://doi.org/10.1109/ICPP.2001.952071

An optimal cache replacement policy for wireless data dissemination under cache consistency. / Xu, Jianliang; Hu, Q.; Lee, Wang-chien; Lee, Dik Lun.

Proceedings - International Conference on Parallel Processing, ICPP 2001. ed. / Lionel M. Ni; Mateo Valero. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. p. 267-274 952071.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An optimal cache replacement policy for wireless data dissemination under cache consistency

AU - Xu, Jianliang

AU - Hu, Q.

AU - Lee, Wang-chien

AU - Lee, Dik Lun

PY - 2001/1/1

Y1 - 2001/1/1

N2 - A good cache management method for mobile wireless environments has to handle problems associated with limited client resources and frequent client disconnections, in addition to standard problems found in wired environments, such as variable data sizes and data updates. In this paper we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely access probability, update frequency, data size, retrieval delay, and cache validation cost. Min-SAUD is optimal in terms of the stretch performance measure. Preliminary experimental results show that in most cases the Min-SAUD replacement policy substantially outperforms two existing policies, namely LRU and SAIU.

AB - A good cache management method for mobile wireless environments has to handle problems associated with limited client resources and frequent client disconnections, in addition to standard problems found in wired environments, such as variable data sizes and data updates. In this paper we propose a gain-based cache replacement policy, Min-SAUD, for wireless data dissemination when cache consistency must be enforced before a cached item is used. Min-SAUD considers several factors that affect cache performance, namely access probability, update frequency, data size, retrieval delay, and cache validation cost. Min-SAUD is optimal in terms of the stretch performance measure. Preliminary experimental results show that in most cases the Min-SAUD replacement policy substantially outperforms two existing policies, namely LRU and SAIU.

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

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

U2 - 10.1109/ICPP.2001.952071

DO - 10.1109/ICPP.2001.952071

M3 - Conference contribution

AN - SCOPUS:84951165242

VL - 2001-January

SP - 267

EP - 274

BT - Proceedings - International Conference on Parallel Processing, ICPP 2001

A2 - Ni, Lionel M.

A2 - Valero, Mateo

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Xu J, Hu Q, Lee W, Lee DL. An optimal cache replacement policy for wireless data dissemination under cache consistency. In Ni LM, Valero M, editors, Proceedings - International Conference on Parallel Processing, ICPP 2001. Vol. 2001-January. Institute of Electrical and Electronics Engineers Inc. 2001. p. 267-274. 952071 https://doi.org/10.1109/ICPP.2001.952071