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
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 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
Volume Leases for Consistency in Large-Scale Systems
IEEE Transactions on Knowledge and 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
Scalability study of cache access mechanisms in multiple-cell wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cooperative wireless data access algorithms in multi-radio wireless networks
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
SPR proxy mechanism for 3GPP Policy and Charging Control System
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cache invalidation strategies for Internet-based vehicular ad hoc networks
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
User-defined consistency sensitive cache invalidation strategies for wireless data access
Computer Communications
Agent-based Mobile Data Caching Strategies Using Data Significance
Journal of Integrated Design & Process Science
| Hi-index | 0.00 |
Cache has been applied for wireless data access with different replacement policies in wireless networks. Most of the current cache replacement schemes are access-based replacement policies since they are based on object access frequency/recency information. Access-based replacement policies either ignore or do not focus on update information. However, update information is extremely important since it can make access information almost useless. In this paper, we consider two fundamental and strongly consistent access algorithms: Poll-Per-Read (PER) and Call-Back (CB). We propose a server-based PER (SB-PER) cache access mechanism in which the server makes replacement decisions and a client-based CB cache access mechanism in which clients make replacement decisions. Both mechanisms have been designed to be suitable for using both update frequency and access frequency. We further propose two update-based replacement policies, least access-to-update ratio (LA2U) and least access-to-update difference (LAUD). We provide a thorough performance analysis via extensive simulations for evaluating these algorithms in terms of access rate, update rate, cache size, database size, object size, etc. Our study shows that although effective hit ratio is a better metric than cache hit ratio, it is a worse metric than transmission cost, and a higher effective hit ratio does not always mean a lower cost. In addition, the proposed SB-PER mechanism is better than the original PER algorithm in terms of effective hit ratio and cost, and the update-based policies outperform access-based policies in most cases.