Update-Based Cache Access and Replacement in Wireless Data Access

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, the authors consider two fundamental and strongly consistent access algorithms: Poll-pEr-Read (PER) and Call-Back (CB). They 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.