Issue No. 12 - December (2007 vol. 56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70768
Hui Chen , Department of Mathematics and Computer Science, Virginia State University, Petersburg, VA 23806
Yang Xiao , Department of Computer Science, University of Alabama, 101 Houser Hall, Box 870290, Tuscaloosa, AL 35487-0290
Cache can be used for mobile devices to reduce the 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 the 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 (R-CB). 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 a 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.
bandwidth allocation, cache storage, client-server systems, radio access networks
H. Chen and Y. Xiao, "On-Bound Selection Cache Replacement Policy for Wireless Data Access," in IEEE Transactions on Computers, vol. 56, no. 12, pp. 1597-1611, 2007.