The multicast bandwidth advantage in serving a web site

Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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, requestedb y 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 comparedwit h 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.

Original languageEnglish (US)
Title of host publicationNetworked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings
Pages88-99
Number of pages12
Volume2233 LNCS
StatePublished - 2001
Event3rd International COST264 Workshop on Networked Group Communication, NGC 2001 - London, United Kingdom
Duration: Nov 7 2001Nov 9 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2233 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International COST264 Workshop on Networked Group Communication, NGC 2001
CountryUnited Kingdom
CityLondon
Period11/7/0111/9/01

Fingerprint

Multicast
Websites
Servers
Bandwidth
Web Server
Hits
Latency
Closed-form

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Azar, Y., Feder, M., Lubetzky, E., Rajwan, D., & Shulman, N. (2001). The multicast bandwidth advantage in serving a web site. In Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings (Vol. 2233 LNCS, pp. 88-99). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2233 LNCS).

The multicast bandwidth advantage in serving a web site. / Azar, Yossi; Feder, Meir; Lubetzky, Eyal; Rajwan, Doron; Shulman, Nadav.

Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings. Vol. 2233 LNCS 2001. p. 88-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2233 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Azar, Y, Feder, M, Lubetzky, E, Rajwan, D & Shulman, N 2001, The multicast bandwidth advantage in serving a web site. in Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings. vol. 2233 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2233 LNCS, pp. 88-99, 3rd International COST264 Workshop on Networked Group Communication, NGC 2001, London, United Kingdom, 11/7/01.
Azar Y, Feder M, Lubetzky E, Rajwan D, Shulman N. The multicast bandwidth advantage in serving a web site. In Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings. Vol. 2233 LNCS. 2001. p. 88-99. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Azar, Yossi ; Feder, Meir ; Lubetzky, Eyal ; Rajwan, Doron ; Shulman, Nadav. / The multicast bandwidth advantage in serving a web site. Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings. Vol. 2233 LNCS 2001. pp. 88-99 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{efa832518bae4ec697f8c5435597c187,
title = "The multicast bandwidth advantage in serving a web site",
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, requestedb y 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 comparedwit h 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.",
author = "Yossi Azar and Meir Feder and Eyal Lubetzky and Doron Rajwan and Nadav Shulman",
year = "2001",
language = "English (US)",
isbn = "3540428240",
volume = "2233 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "88--99",
booktitle = "Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings",

}

TY - GEN

T1 - The multicast bandwidth advantage in serving a web site

AU - Azar, Yossi

AU - Feder, Meir

AU - Lubetzky, Eyal

AU - Rajwan, Doron

AU - Shulman, Nadav

PY - 2001

Y1 - 2001

N2 - 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, requestedb y 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 comparedwit h 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.

AB - 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, requestedb y 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 comparedwit h 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.

UR - http://www.scopus.com/inward/record.url?scp=33751041351&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751041351&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33751041351

SN - 3540428240

SN - 9783540428244

VL - 2233 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 88

EP - 99

BT - Networked Group Communication - Third International COST264 Workshop, NGC 2001, Proceedings

ER -