{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/36638"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/36638","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Optimizing Response Time, Rather than Hit Rates, of WWW Proxy Caches","abstract":"This thesis investigates the possibility of improving World Wide Web (WWW) proxy cache performance. Most published research on proxy caches is concerned only with improving the cache hit rate. Improving only the hit rate, however, ignores the actual retrieval times experienced by WWW browser users. This research investigates removal algorithms that consider the time to download a file as a factor. Our experiments show that a removal algorithm that minimizes only the download time yields poor results. However, a new algorithm is investigated that does provide improved performance over common removal algorithms using three factors --- the speed at which a file is downloaded, the size of the file, and the number of references to the file (the number of hits). Experiments are conducted with a modified version of the Harvest Cache which has been made available on the Internet from the Virginia Tech Network Research Group's (VT-NRG) home page. WWW traffic from the \".edu\" domain is used in all of the experiments. Five different removal algorithms are compared: least recently used, least frequently used, document size, and two new algorithms. The results indicate that the new three factor algorithm reduces the average latency experienced by users.","abstract_html":"This thesis investigates the possibility of improving World Wide Web (WWW) proxy cache performance. Most published research on proxy caches is concerned only with improving the cache hit rate. Improving only the hit rate, however, ignores the actual retrieval times experienced by WWW browser users. This research investigates removal algorithms that consider the time to download a file as a factor. Our experiments show that a removal algorithm that minimizes only the download time yields poor results. However, a new algorithm is investigated that does provide improved performance over common removal algorithms using three factors --- the speed at which a file is downloaded, the size of the file, and the number of references to the file (the number of hits). Experiments are conducted with a modified version of the Harvest Cache which has been made available on the Internet from the Virginia Tech Network Research Group's (VT-NRG) home page. WWW traffic from the ".edu" domain is used in all of the experiments. Five different removal algorithms are compared: least recently used, least frequently used, document size, and two new algorithms. The results indicate that the new three factor algorithm reduces the average latency experienced by users.","abstract_has_math":false,"creators":["Wooster, Roland Peter"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science","degree_department":"Computer Science","school":null,"contributors":[],"advisors":[],"committee_chairs":["Abrams, Marc"],"committee_members":["Midkiff, Scott F.","Fox, Edward A."],"year":1996,"date_issued":"1996-12-19","date_published":"1996-12-19","updated_at":"2026-07-22T22:19:19Z","subjects":["none"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-34131420119653540"],"render_values":[{"text":"etd-34131420119653540","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/36638","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Abrams, Marc"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Midkiff, Scott F.","Fox, Edward A."]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science"]},{"key":"dc:creator","label":"Author","values":["Wooster, Roland Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:51:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:51:21Z","1996-12-19"]},{"key":"dc:date.issued","label":"Date","values":["1996-12-19"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["none"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-34131420119653540"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/36638"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis investigates the possibility of improving World Wide Web (WWW) proxy cache performance. Most published research on proxy caches is concerned only with improving the cache hit rate. Improving only the hit rate, however, ignores the actual retrieval times experienced by WWW browser users. This research investigates removal algorithms that consider the time to download a file as a factor. Our experiments show that a removal algorithm that minimizes only the download time yields poor results. However, a new algorithm is investigated that does provide improved performance over common removal algorithms using three factors --- the speed at which a file is downloaded, the size of the file, and the number of references to the file (the number of hits). Experiments are conducted with a modified version of the Harvest Cache which has been made available on the Internet from the Virginia Tech Network Research Group's (VT-NRG) home page. WWW traffic from the \".edu\" domain is used in all of the experiments. Five different removal algorithms are compared: least recently used, least frequently used, document size, and two new algorithms. The results indicate that the new three factor algorithm reduces the average latency experienced by users."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:title","label":"Title","values":["Optimizing Response Time, Rather than Hit Rates, of WWW Proxy Caches"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Abrams, Marc"],"dc:contributor.committeemember":["Midkiff, Scott F.","Fox, Edward A."],"dc:contributor.department":["Computer Science"],"dc:creator":["Wooster, Roland Peter"],"dc:date.accessioned":["2014-03-14T20:51:21Z"],"dc:date.available":["2014-03-14T20:51:21Z","1996-12-19"],"dc:date.issued":["1996-12-19"],"dc:description.abstract":["This thesis investigates the possibility of improving World Wide Web (WWW) proxy cache performance. Most published research on proxy caches is concerned only with improving the cache hit rate. Improving only the hit rate, however, ignores the actual retrieval times experienced by WWW browser users. This research investigates removal algorithms that consider the time to download a file as a factor. Our experiments show that a removal algorithm that minimizes only the download time yields poor results. However, a new algorithm is investigated that does provide improved performance over common removal algorithms using three factors --- the speed at which a file is downloaded, the size of the file, and the number of references to the file (the number of hits). Experiments are conducted with a modified version of the Harvest Cache which has been made available on the Internet from the Virginia Tech Network Research Group's (VT-NRG) home page. WWW traffic from the \".edu\" domain is used in all of the experiments. Five different removal algorithms are compared: least recently used, least frequently used, document size, and two new algorithms. The results indicate that the new three factor algorithm reduces the average latency experienced by users."],"dc:description.degree":["Master of Science"],"dc:identifier.other":["etd-34131420119653540"],"dc:identifier.uri":["http://hdl.handle.net/10919/36638"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["none"],"dc:title":["Optimizing Response Time, Rather than Hit Rates, of WWW Proxy Caches"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:19Z"}