DocumentCode
3220180
Title
Caching neighborhood protocol: A foundation for building dynamic Web caching hierarchies with proxy servers
Author
Chiang, Cho-Yu ; Liu, Ming T. ; Muller, M.E.
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fYear
1999
fDate
1999
Firstpage
516
Lastpage
523
Abstract
In this paper we propose a Caching Neighborhood Protocol (CNP) that describes an infrastructure upon which proxy servers can build dynamic Web caching hierarchies. Such a scheme decreases the response times for the requests by increasing the availability of documents without compromising the currency of the rendered documents. Some qualitative reasonings and studies on the request accessing traces collected by a proxy server at NLANR are presented to justify CNP. A five-day trace analysis shows that the top 20% Web sites (in terms of frequency of accesses) provide 93% of the most frequently accessed top 20% documents and such top 20% documents account for 94% of the documents that have been accessed more than once. Hence, an important observation is that caching the most popular documents provided by the most popular Web sites would be a very effective approach for Web caching
Keywords
cache storage; common-sense reasoning; information resources; memory protocols; Web caching; caching neighborhood protocol; dynamic Web caching hierarchies; proxy servers; qualitative reasonings; response times; trace analysis; Information science; Internet; Joining processes; Network servers; Optimized production technology; Protocols; Quality of service; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1999. Proceedings. 1999 International Conference on
Conference_Location
Aizu-Wakamatsu City
ISSN
0190-3918
Print_ISBN
0-7695-0350-0
Type
conf
DOI
10.1109/ICPP.1999.797440
Filename
797440
Link To Document