最小访问代价缓存替换算法

Minimal access cost cache replacement algorithm

针对无线数据环境中,缓存替换策略与数据大小、数据更新频率和客户端断接等密切相关,提出了最小访问代价缓存替换算法(MACCR),并考虑了缓存验证的开销.通过考察用户访问的数据与缓存命中之间的关系,推导了最优化的缓存替换集合,并给出了具体的实现方法.模拟实验结果表明,与LRU和LRU-MIN算法相比,该算法在减少平均访问时间和降低广播数据量方面具有更好的性能.

In the environment of mobile application,strategy of cache replace is affected by some factors such as data size,frequency of data update and the disconnect of client.Most of the existing researches ignore one or several factors of them.Minimal access cost cache replacement method is presented based on them in which the cost for cache verification is taken into account at the same time.In this paper we have studied the relationship between the data accessed by the user and the cache missing,obtained the data set which should be replaced and given the method to realize.The experiment result shows that,compared with other two methods,MACCR is more effective both on decreasing the mean access and deceasing the data number to be broadcast.