TY - JOUR
T1 - Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination
AU - XU, Jianliang
AU - Hu, Qinglong
AU - Lee, Wang Chien
AU - Lee, Dik Lun
N1 - Funding Information:
The authors would like to thank the anonymous reviewers for their valuable comments and suggestions that improved the quality of this paper. The research was supported by the Research Grant Council, Hong Kong SAR, China, under grant numbers HKUST-6241/00E and HKUST6079/01E.
PY - 2004/1
Y1 - 2004/1
N2 - 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.
AB - 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.
KW - Cache consistency
KW - Cache replacement
KW - Data management
KW - Mobile computing
KW - Performance analysis
KW - Wireless data dissemination
UR - http://www.scopus.com/inward/record.url?scp=0742286178&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2004.1264827
DO - 10.1109/TKDE.2004.1264827
M3 - Journal article
AN - SCOPUS:0742286178
SN - 1041-4347
VL - 16
SP - 125
EP - 139
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 1
ER -