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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Chawathe, S. McCanne, and E. Brewer. RMX: Reliable multicast for heterogeneous networks. In Proceedings of IEEE INFOCOM, 2000.
Y. Chu, S. Rao, and H. Zhang.A case for end system multicast. In Proceedings of ACM SIGMETRICS, June 2000.
P. Francis. Yoid: Your own Internet distribution. Technical report, ACIRI, http://www.aciri.org/yoid, April, 2000.
J. D. Guyton and M. F. Schwartz. Experiences with a survey tool for discovering network time protocol servers. In Proc. of USENIX, 1994.
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.
S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placement on the Internet. In Proceedings of IEEE Infocom, 2001.
J. Jannotti et al. Overcast: Reliable multicastingw ith an overlay network. In Proceedings of OSDI, 2000.
Mirror Image Internet Inc. http://www.mirror-image.com.
D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of 3rd USITS, 2001.
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.
L. Qiu, V. N. Padmanabhan, and G. Voelker. On the placement of Web server replicas. In Proceedings of IEEE Infocom, 2001.
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.
P. Rodriguez and S. Sibal. SPREAD: Scaleable platform for reliable and efficient automated distribution. In Proceedings of WWW, 2000.
A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. In Proc. of Middleware 2001.
Speedera Inc. http://www.speedera.com.
I. Stoica et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.
E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an Internetwork. In Proceedings of IEEE INFOCOM, 1996.
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.
S. Q. Zhuang et al. Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination. In Proceedings of ACM NOSSDAV, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45748-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-45748-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44179-3
Online ISBN: 978-3-540-45748-0
eBook Packages: Springer Book Archive