Performance analysis of server-based poll-each-read in wireless Internet

Cache mechanisms have been proposed for wireless data access. Poll-each-read (PER) is a fundamental cache access algorithm and has been studied in wireless data access. However, PER overlooks the importance of update information. In this paper, we propose a server-based PER (SB-PER) cache access mechanism in which the server makes replacement decisions. Through extensive simulations, we provide a profound performance analysis for the SB-PER in terms of access rate, update rate, cache size, and database size, which is useful for understanding of the related algorithms. Simulation results show that the proposed SB-PER outperforms the original PER in terms of effective hit ratio and cost.