Abstract
Delivering popular web pages to the clients results in high bandwidth and high load on the web servers. A method to overcome this problem is to sendth ese pages, requested by many users, via multicast. In this paper, we provide an analytic criterion to determine which pages to multicast, andan alyze the overall saving factor as compared with a unicast delivery. The analysis is based on the well known observation that page popularity follows a Zipf-like distribution. Interestingly, we can obtain closed-form analytical expressions for the saving factor, that show the multicast advantage as a function of the site hit-rate, the allowed latency andthe Zipf parameter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Angel. Caching in with content delivery. NPN: New Public Network Magazine, http://www.networkmagazine.com, 2000.
L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching andzip f-like distributions: Evidence and implications. In Infocom, 1999.
John W. Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, pages 56–67, 1998.
R. J. Clark and M. H. Ammar. Providing scalable Web services using multicast communication. Computer Networks and ISDN Systems, 29(7):841–858, 1997.
M. Crovella and A. Bestavros. Self-similarity in WorldWideWeb traffic: Evidence andp ossible causes. IEEE/ACM Transactions on Networking, 5(6):835–846, 1997.
D. Dolev, O. Mokryn, Y. Shavitt, and I. Sukhov. An integrated architecture for the scalable delivery of semi-dynamic web content. Technical report, Computer Science, Hebrew University, 2000.
A. Dornan. Farming out the web servers. NPN: New Public Network Magazine, http://www.networkmagazine.com, 2000.
Z. Fei, K. Almeroth, and M. Ammar. Scalable delivery of web pages using cyclicbest-effort (udp) multicast. In Infocom, 1998.
P. Krishnan, D. Raz, and Y. Shavitt. The cache location problem. In IEEE/ACM Transaction on Networking (ToN), 2000.
V. Padmanabhan and L. Qiu. The content and access dynamics of a busy web site: Findings and implications. In ACM SIGCOMM 2000, 2000.
V. Paxson and S. Floyd. Wide area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, 3(3):226–244, 1995.
A. Wolman, G. M. Voelker, N. Sharma, N. Cardwell, A. R. Karlin, and H. M. Levy. On the scale andp erformance of cooperative web proxy caching. In Symposium on Operating Systems Principles, pages 16–31, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azar, Y., Feder, M., Lubetzky, E., Rajwan, D., Shulman, N. (2001). The Multicast Bandwidth Advantage in Serving a Web Site. In: Crowcroft, J., Hofmann, M. (eds) Networked Group Communication. NGC 2001. Lecture Notes in Computer Science, vol 2233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45546-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-45546-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42824-4
Online ISBN: 978-3-540-45546-2
eBook Packages: Springer Book Archive