Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Scalable Web Caching of Frequently Updated Objects Using Reliable Multicast

Frequently updated web objects reduce the benefit of caching, increase the problem of cache inconsistency, and aggravate the inefficiency of the conventional "repeated unicast" delivery model. In this paper, we investigate multicast invalidation and delivery of popular, frequently updated objects to web cache proxies. Our protocol, MMO, groups objects into volumes, each of which maps to one IP multicast group. We show that, by forming volumes of the appropriate size and/or object correlation, the benefit from reliable multicast outweighs the cost of delivering extraneous data as well as the overhead of multicast reliability. Moreover, trace-driven simulations show that the bandwidth saving over conventional approaches increases significantly as the audience size grows. We conclude that MMO provides efficient bandwidth utilization and service scalability, and makes strong web cache consistency for dynamic objects practical.

Dan Li, Stanford University

David R. Cheriton, Stanford University

BibTeX
@inproceedings {271517,
author = {Dan Li and David R. Cheriton},
title = {Scalable Web Caching of Frequently Updated Objects Using Reliable Multicast },
booktitle = {Second USENIX Symposium on Internet Technologies \& Systems (USITS 99)},
year = {1999},
address = {Boulder, CO },
url = {https://www.usenix.org/conference/usits-99/scalable-web-caching-frequently-updated-objects-using-reliable-multicast},
publisher = {USENIX Association},
month = oct
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/usits99/full_papers/li/li.pdf
Paper (HTML): 
http://usenix.org/publications/library/proceedings/usits99/full_papers/li/li_html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us