By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hui Chen ; Dept. of Comput. Sci., Memphis Univ., TN, USA ; Yang Xiao ; Xuemin Shen

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.

Published in:

Global Telecommunications Conference, 2005. GLOBECOM '05. IEEE  (Volume:2 )

Date of Conference:

28 Nov.-2 Dec. 2005