Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Sleepers and workaholics: caching strategies in mobile environments
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Experiences of developing and deploying a context-aware tourist guide: the GUIDE project
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Using semantic caching to manage location dependent data in mobile computing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Data Management in Location-Dependent Information Services
IEEE Pervasive Computing
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
IEEE Transactions on Computers
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
Location Dependent Data and its Management in Mobile Databases
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
A Generalized Target-Driven Cache Replacement Policy for Mobile Environments
SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
K nearest neighbor search in navigation systems
Mobile Information Systems
A weighted cache replacement policy for location dependent data in mobile environments
Proceedings of the 2007 ACM symposium on Applied computing
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An overview of web caching replacement algorithms
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Caching frequently accessed items on the mobile client is an important technique to enhance data availability and to improve data access time. Cache replacement policies are used to find a suitable subset of items for eviction from the cache due to limited cache size. The existing policies rely on Euclidean space and consider Euclidean distance as an important parameter for eviction. However, in practice the position and movement of objects are constrained to spatial networks where the important distance measure is the network distance. In this paper we propose a cache replacement policy, which considers the network density, network distance and probability of access as important factors for eviction. We make use of an already proven technique called Progressive incremental network expansion to compute the network distance more efficiently. A series of simulation experiments have been conducted to evaluate the performance of the policy. Results indicate that the proposed cache replacement scheme performs significantly better than the existing policies FAR and PAID and WPRRP.