Dynamic Replica Placement for Scalable Content Delivery

  • Yan Chen
  • Randy H. Katz
  • John D. Kubiatowicz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [2]
    Y. Chawathe, S. McCanne, and E. Brewer. RMX: Reliable multicast for heterogeneous networks. In Proceedings of IEEE INFOCOM, 2000.Google Scholar
  2. [3]
    Y. Chu, S. Rao, and H. Zhang.A case for end system multicast. In Proceedings of ACM SIGMETRICS, June 2000.Google Scholar
  3. [5]
    P. Francis. Yoid: Your own Internet distribution. Technical report, ACIRI, http://www.aciri.org/yoid, April, 2000.
  4. [6]
    J. D. Guyton and M. F. Schwartz. Experiences with a survey tool for discovering network time protocol servers. In Proc. of USENIX, 1994.Google Scholar
  5. [7]
    K. Jain and V. Varirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. In Proc. of FOCS, 1999.Google Scholar
  6. [8]
    S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placement on the Internet. In Proceedings of IEEE Infocom, 2001.Google Scholar
  7. [9]
    J. Jannotti et al. Overcast: Reliable multicastingw ith an overlay network. In Proceedings of OSDI, 2000.Google Scholar
  8. [10]
    Mirror Image Internet Inc. http://www.mirror-image.com.
  9. [11]
    D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of 3rd USITS, 2001.Google Scholar
  10. [12]
    C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessingne arby copies of replicated objects in a distributed environment. In Proc. of the SCP SPAA, 1997.Google Scholar
  11. [13]
    L. Qiu, V. N. Padmanabhan, and G. Voelker. On the placement of Web server replicas. In Proceedings of IEEE Infocom, 2001.Google Scholar
  12. [14]
    S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.Google Scholar
  13. [15]
    P. Rodriguez and S. Sibal. SPREAD: Scaleable platform for reliable and efficient automated distribution. In Proceedings of WWW, 2000.Google Scholar
  14. [16]
    A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. In Proc. of Middleware 2001.Google Scholar
  15. [17]
  16. [18]
    I. Stoica et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.Google Scholar
  17. [19]
    E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an Internetwork. In Proceedings of IEEE INFOCOM, 1996.Google Scholar
  18. [20]
    B. Y. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for faulttolerant wide-area location and routing. UCB Tech. Report UCB/CSD-01-1141.Google Scholar
  19. [21]
    S. Q. Zhuang et al. Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination. In Proceedings of ACM NOSSDAV, 2001.Google Scholar

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

Personalised recommendations