Dynamic Replica Placement for Scalable Content Delivery

Dynamic Replica Placement for Scalable Content Delivery (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Yan Chen , Randy H. Katz , Y H. Katz , John D. Kubiatowicz

Venue:	In Proceedings of IPTPS’02
Citations:	51 - 1 self

BibTeX

@INPROCEEDINGS{Chen02dynamicreplica,
    author = {Yan Chen and Randy H. Katz and Y H. Katz and John D. Kubiatowicz},
    title = {Dynamic Replica Placement for Scalable Content Delivery},
    booktitle = {In Proceedings of IPTPS’02},
    year = {2002},
    pages = {306--318}
}

Years of Citing Articles

Bookmark

OpenURL

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.

Citations

3028	H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1503	Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
968	A Case for End System Multicast - Chu, Rao, et al. - 2000
928	Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
594	How to model an internetwork - Zegura, Calvert, et al.
422	Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
363	Bayeux: An architecture for scalable and faulttolerant wide-area data dissemination - Zhuang, Zhao, et al. - 2001
277	Approximation algorithms for metric facility location and k-median problems using the primaldual schema and lagrangian relaxation - Jain, Vazirani - 2001
276	ALMI: An Application level Multicast Infrastructure - Pendarakis, Shi, et al. - 2001
243	On the placement of web server replicas - Qiu, Padmanabham, et al. - 2001
102	Rmx: Reliable multicast for heterogeneous networks - Chawathe, McCanne, et al. - 2000
75	et al. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications - Stoica - 2001
75	Constrained mirror placement on the Internet - JAMIN, JIN, et al. - 2001
56	et al., “A Scalable Content Addressable Network - Ratnasamy
36	Yoid: Your Own Internet Distribution - Francis - 2001
14	et al., “Overcast: Reliable Multicasting with an Overlay Network - Jannotti, Gifford - 2000
9	Experiences with a survey tool for discovering Network Time Protocol servers - Guyton, Schwartz - 1994
8	et al. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination - Zhuang - 2001
6	et al. Tapestry: An infrastructure for fault-tolerant widearea location and routing - Zhao - 2001
5	Spread: Scaleable platform for reliable and efficient automated distribution - Rodriguez, Sibal - 2000
4	et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems - Rowstron
4	et al. Constrained Mirror Placement on the Internet - Jamin - 2001
4	et al. Quantifying network denial of service: A location service case study - Chen - 2001
1	ALMI: An application level multicast infrastructure - al - 2001
1	Accessing nearby copies of replicated objects in a distributed environment - al - 1997
1	et al. Experiences with a survey tool for discovering network time protocol servers - Guyton - 1994
1	et al. Spread: Scaleable platform for reliable and efficient automated distribution - Rodriguez - 2000
1	et al. RMX: Reliable multicast for heterogeneous networks - Chawathe - 2000