Scale and performance in a distributed file system
ACM Transactions on Computer Systems (TOCS)
Caching in the Sprite network file system
ACM Transactions on Computer Systems (TOCS)
Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Bit-sequences: an adaptive cache invalidation method in mobile client/server environments
Mobile Networks and Applications
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Energy-efficient selective cache invalidation
Wireless Networks
SAIU: an efficient cache replacement policy for wireless on-demand broadcasts
Proceedings of the ninth international conference on Information and knowledge management
An Evaluation of Cache Invalidation Strategies in Wireless Environments
IEEE Transactions on Parallel and Distributed Systems
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment
IEEE Transactions on Parallel and Distributed Systems
Proactive Power-Aware Cache Management for Mobile Computing Systems
IEEE Transactions on Computers
Computer Networks
Sleepers and workaholics: caching strategies in mobile environments (extended version)
The VLDB Journal — The International Journal on Very Large Data Bases
Volume Leases for Consistency in Large-Scale Systems
IEEE Transactions on Knowledge and Data Engineering
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Energy-Efficient Caching for Wireless Mobile Computing
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Cache Management for Mobile Databases: Design and Evaluation
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
IEEE Transactions on Knowledge and Data Engineering
Performance Evaluation of an Optimal Cache Replacement Policy for Wireless Data Dissemination
IEEE Transactions on Knowledge and Data Engineering
An evaluation of buffer management strategies for relational database systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
An overview of web caching replacement algorithms
IEEE Communications Surveys & Tutorials
Effects of cache mechanism on wireless data access
IEEE Transactions on Wireless Communications
Optimal location management for two-tier PCS networks
Computer Communications
Scalability study of cache access mechanisms in multiple-cell wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy saving strategies for cooperative cache replacement in mobile ad hoc networks
Pervasive and Mobile Computing
SPR proxy mechanism for 3GPP Policy and Charging Control System
Computer Networks: The International Journal of Computer and Telecommunications Networking
Estimating instantaneous cache hit ratio using Markov chain analysis
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 14.98 |
Cache can be used for mobile devices to reduce usage of limited bandwidth in wireless networks. Ideally, frequently accessed and infrequently updated data items should be cached, and infrequently accessed and frequently updated data items should be evicted or not cached at all. Most of existing cache replacement policies adopt only access information so that frequently updated data items are also cached. As a remedy, we propose a cache replacement policy, called On-Bound Selection (OBS), that uses both data access and update information. The proposed OBS is inspired by an analytical analysis for a server-based Poll-Each-Read (SB-PER) and a revised Call-back (RCB). The OBS provides an upper bound for effective hit ratio and a lower bound for communication cost. The proposed scheme is evaluated and compared with least-frequently-used (LFU) replacement policy through extensive simulations. Simulation results show that the OBS outperforms LFU in terms of both effective hit ratio and communication cost.