Dynamic Replica Placement for Scalable Content Delivery

  • Yan Chen
  • Randy H. Katz
  • John D. Kubiatowicz
Conference paper

DOI: 10.1007/3-540-45748-8_29

Volume 2429 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chen Y., Katz R.H., Kubiatowicz J.D. (2002) Dynamic Replica Placement for Scalable Content Delivery. In: Druschel P., Kaashoek F., Rowstron A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg

Abstract

In this paper, we propose the dissemination tree, a dynamic content distribution system built on top of a peer-to-peer location service. We present a replica placement protocol that builds the tree while meeting QoS and server capacity constraints. The number of replicas as well as the delay and bandwidth consumption for update propagation are significantly reduced. Simulation results show that the dissemination tree has close to the optimal number of replicas, good load distribution, small delay and bandwidth penalties for update multicast compared with the ideal case: static replica placement on IP multicast.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Yan Chen
    • 1
  • Randy H. Katz
    • 1
  • John D. Kubiatowicz
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley