Page Rank Prefetching for Optimzing Accesses to Web Page Clusters

نویسندگان

  • Victor Safronov
  • Manish Parashar
چکیده

This paper presents a Page Rank based prefetching technique for accesses to web page clusters. The approach uses the link structure of a requested page to determine the “most important” linked pages and to identify the page(s) to be prefetched. The underlying premise of our approach is that in the case of cluster accesses, the next pages requested by users of the web server are typically based on the current and previous pages requested. Furthermore, if the requested pages have a lot of links to some “important” page, that page has a higher probability of being the next one requested. An experimental evaluation of the prefetching mechanism is presented using real server logs. The results show that the Page-Rank based scheme does better than random prefetching for clustered accesses, with hit rates of 90% in some cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on the paper: Optimizing web servers using page rank prefetching for clustered accesses

In this short note, we briefly present and discuss an example of page rank algorithm given in [Information Sciences 150 (2003) 165–176]. 2004 Elsevier Inc. All rights reserved.

متن کامل

A Survey on Web Page Prediction and Prefetching Models

this paper performs a survey on Web Page Prediction and Prefetching Methods. Prediction and Prefetching methods of Web page have been widely used to reduce the access latency problem on the networks. If Prediction and Prefetching of Web page are not accurate and Prefetched web pages are not visited by the users in their accesses, which mean it is totally wastage of time and bandwidth of network...

متن کامل

Markov Tree Prediction on Web Cache Prefetching

As Web accesses increase exponentially in the past decade, it is fundamentally important for Web servers to be able to minimize the latency and respond to users’ requests very quickly. One commonly used strategy is to “predict” what pages the user is likely to access in the near future so that the server can prefetch these pages and store them in a cache on the local machine, a Web proxy or a W...

متن کامل

An Efficient Approach For Optimal Prefetching To Reduce Web Access Latency

The exponential growth and popularity of WWW increases the amount of traffic which results in major congestion problems over the available bandwidth for the retrieval of data. This results in the increase of user perceived latency. Prefetching of web pages is a potential area that can significantly reduce the web access latency. It refers to the mechanism of deducing the forthcoming page access...

متن کامل

A Study on Web Prefetching Techniques

The growth of the World Wide Web has emphasized the need for improvement in user latency. One of the techniques that are used for improving user latency is Web Prefetching. Web prefetching is one of the techniques proposed to reduce user’s perceived latencies in the World Wide Web. The spatial locality shown by user’s accesses makes it possible to predict future accesses based on the previous o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003