Skip to Main Content
Frequently Asked Questions
Submit an ETD
Global Search Box
Need Help?
Keyword Search
Participating Institutions
Advanced Search
School Logo
Files
File List
akron1164053047.pdf (336.97 KB)
ETD Abstract Container
Abstract Header
PERFORMANCE EVALUATION OF AN ENHANCED POPULARITY-BASED WEB PREFETCHING TECHNIQUE
Author Info
Sharma, Mayank
Permalink:
http://rave.ohiolink.edu/etdc/view?acc_num=akron1164053047
Abstract Details
Year and Degree
2006, Master of Science, University of Akron, Computer Science.
Abstract
The growth of the World Wide Web has been tremendous over the last decade, but at the same time, it has exacerbated the response time as perceived by users in accessing web documents. Web Caching and web prefetching are techniques used to alleviate such problems. Caching improve access latency by locally storing previously accessed web documents whereas prefetching techniques rely on predictive approaches to speculatively retrieve and store web objects into the cache for future use. Predictions on what to prefetch are made based on different criteria such as access patterns, popularity and structure of documents accessed. Prefetching approaches differ in their implementation and complexity, but more importantly in the performance that can be achieved based upon the prediction accuracy. In this work, we introduce a simple and transparent popularity-based prefetching algorithm which combines both the top 10 and next-n prefetching approaches. In addition to using access-frequency as the criteria for prefetching, we also use the time of access of web documents to generate the top 10 list. This approach of using access-frequency and time of access is known as the GDSP approach, which has been used in cache management. Instead of generating next-n list for all the documents accessed by the users, we log the next-n documents for the top 10 documents only, thus reducing complexity and overhead. The results obtained from simulations, in terms of hit rate and prefetching effectiveness show the efficacy of our proposed algorithm as compared to other approaches. Future work includes making the proposed approach dynamic by refreshing the top 10 list with the latest GDSP values and prefetching dynamic web documents.
Committee
Xuan-Hien Dang (Advisor)
Pages
43 p.
Subject Headings
Computer Science
Keywords
web prefetching
;
proxy server prefetching
;
popularity based prefetching
Recommended Citations
Refworks
EndNote
RIS
Mendeley
Citations
Sharma, M. (2006).
PERFORMANCE EVALUATION OF AN ENHANCED POPULARITY-BASED WEB PREFETCHING TECHNIQUE
[Master's thesis, University of Akron]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=akron1164053047
APA Style (7th edition)
Sharma, Mayank.
PERFORMANCE EVALUATION OF AN ENHANCED POPULARITY-BASED WEB PREFETCHING TECHNIQUE.
2006. University of Akron, Master's thesis.
OhioLINK Electronic Theses and Dissertations Center
, http://rave.ohiolink.edu/etdc/view?acc_num=akron1164053047.
MLA Style (8th edition)
Sharma, Mayank. "PERFORMANCE EVALUATION OF AN ENHANCED POPULARITY-BASED WEB PREFETCHING TECHNIQUE." Master's thesis, University of Akron, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=akron1164053047
Chicago Manual of Style (17th edition)
Abstract Footer
Document number:
akron1164053047
Download Count:
820
Copyright Info
© 2006, all rights reserved.
This open access ETD is published by University of Akron and OhioLINK.