We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Novel web cache architecture

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
$31 $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

2 Author(s)
Kalia, M. ; Sch. of Comput. Sci., Shobhit Univ., Meerut, India ; Sood, R.

Web cache is system that is placed between the servers and the clients so as to retrieve the web objects to the clients as quickly as possible. But the algorithms present today are not so efficient to retain the important objects in the web cache. In this paper we analyze several replacement algorithms used in web cache like LFU, LRU and find that sometimes important links are also replaced. Whenever those links are requested again, than that request has to be directed to the server which results in wastage of time. These findings guide us to propose a new underlying architecture over which any of the desired replacement algorithms can be used. Beside replacement factors like recency or frequency used in the replacement we use other factors like Link Rank and Penetration Factor. We divided the web cache into five regions: Mature Region, Young Space, Micro-Cache, Non Popular Object Region and Trash Bin.

Published in:

Control Automation Robotics & Vision (ICARCV), 2010 11th International Conference on

Date of Conference:

7-10 Dec. 2010