期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：3
出版社：S.S. Mishra
摘要：Due to the fast development of internet services and a huge amount of network traffic, it is becom-ing an essential issue to reduce World Wide Web user-perceived latency. Web prefetching is a technique fo-cused on web latency reduction based on predicting the next future web object to be accessed by the user and prefetching it in idle times. So, if finally the user requests it, the object will be already at the client's cache. The basics of web prefetching techniques preprocess the user requests, before they are actually demanded. There-fore, the time that the user must wait for the requested documents can be reduced by hiding the request laten-cies. In this work, we introduce a simple and transparent enhanced prefetching algorithm which co mbines both the top 10 and next-n prefetching approaches. In addition to using access-frequency as the criteria for pre-fetching, the proposed algorithm also use the time of access of web do cuments to generate the top 10 list. Keywords: Web cache, Web prefetch, Latency, Access time
