Data profit based cache replacement in mobile environment

Caching is a promising technique in mobile computing environment for improving the data retrieval performance. Due to cache size limitations, cache replacement algorithms are used to find a suitable subset of items for eviction from the cache. Cached items in a client are related to each other and therefore replacement of a data item which is highly associated may lead to series of misses during client's subsequent requests. The existing policies for cache replacement in mobile environment do not consider relationship among data items along with caching parameters. This paper proposes a novel cache replacement policy, R-LPV that considers the caching parameters of a data item along with the relationship of this item with the cache set. The simulation experiments show that, the R-LPV policy substantially outperforms other policies