<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">James Gwertzman</style></author><author><style face="normal" font="default" size="100%">Margo Seltzer</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">World Wide Web Cache Consistency</style></title><secondary-title><style face="normal" font="default" size="100%">1996 USENIX Annual Technical Conference</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">WWW</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1996</style></year><pub-dates><date><style  face="normal" font="default" size="100%">January 1996</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.eecs.harvard.edu/syrah/papers/usenix-96-webcache/</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The bandwidth demands of the World Wide Web continue to grow at a hyper-exponential rate. Given this rocketing growth, caching of web objects as a means to reduce network bandwidth consumption is likely to be a necessity in the very near future. Unfortunately, many Web caches do not satisfactorily maintain cache consistency. This paper presents a survey of contemporary cache consistency mechanisms in use on the Internet today and examines recent research in Web cache consistency. Using trace-driven simulation, we show that a weak cache consistency protocol (the one used in the Alex ftp cache) reduces network bandwidth consumption and server load more than either time-to-live fields or an invalidation protocol and can be tuned to return stale data less than 5% of the time. </style></abstract></record></records></xml>