Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination

Jianliang XU*, Qinglong Hu, Wang Chien Lee, Dik Lun Lee

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

91 Citations (Scopus)


Data caching at mobile clients is an important technique for improving the performance of wireless data dissemination systems. However, variable data sizes, data updates, limited client resources, and frequent client disconnections make cache management a challenge. 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. This paper employs stretch as the major performance metric since it accounts for the data service time and, thus, is fair when items have different sizes. We prove that Min-SAUD achieves optimal stretch under some standard assumptions. Moreover, a series of simulation experiments have been conducted to thoroughly evaluate the performance of Min-SAUD under various system configurations. The simulation results show that, in most cases, the Min-SAUD replacement policy substantially outperforms two existing policies, namely, LRU and SAIU.

Original languageEnglish
Pages (from-to)125-139
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Issue number1
Publication statusPublished - Jan 2004

Scopus Subject Areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

User-Defined Keywords

  • Cache consistency
  • Cache replacement
  • Data management
  • Mobile computing
  • Performance analysis
  • Wireless data dissemination


Dive into the research topics of 'Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination'. Together they form a unique fingerprint.

Cite this