Dynamic replica placement for scalable content delivery

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

Volumn 2429, Issue , 2002, Pages 306-318

  Chen, Yan ^a   Katz, Randy H ^a   Kubiatowicz, John D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; MULTICASTING;

BANDWIDTH CONSUMPTION; CONTENT DELIVERY; DISSEMINATION TREES; DYNAMIC REPLICA; LOAD DISTRIBUTIONS; LOCATION SERVICES; REPLICA PLACEMENT; SERVER CAPACITY;

PEER TO PEER NETWORKS;

EID: 84947242606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45748-8_29     Document Type: Conference Paper

References (21)

1. Akamai Technologies Inc. http://www.akamai.com.
2. Y. Chawathe, S. McCanne, and E. Brewer. RMX: Reliable multicast for heterogeneous networks. In Proceedings of IEEE INFOCOM, 2000.
3. Y. Chu, S. Rao, and H. Zhang. A case for end system multicast. In Proceedings of ACM SIGMETRICS, June 2000.
4. Digital Island Inc. http://www.digitalisland.com.
5. P. Francis. Yoid: Your own Internet distribution. Technical report, ACIRI, http://www.aciri.org/yoid, April, 2000.
6. J. D. Guyton and M. F. Schwartz. Experiences with a survey tool for discovering network time protocol servers. In Proc. of USENIX, 1994.
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.
8. S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placemen on the Internet. In Proceedings of IEEE Infocom, 2001.
9. J. Jannotti et al. Overcast: Reliable multicastingw ith an overlay network. In Proceedings of OSDI, 2000.
10. Mirror Image Internet Inc. http://www.mirror-image.com.
11. D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of 3rd USITS, 2001.
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.
13. L. Qiu, V. N. Padmanabhan, and G. Voelker. On the placement of Web server replicas. In Proceedings of IEEE Infocom, 2001.
14. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.
15. P. Rodriguez and S. Sibal. SPREAD: Scaleable platform for reliable and efficient automated distribution. In Proceedings of WWW, 2000.
16. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. In Proc. of Middleware 2001.
17. Speedera Inc. http://www.speedera.com.
18. I. Stoica et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.
19. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an Internetwork. In Proceedings of IEEE INFOCOM, 1996.
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.
21. S. Q. Zhuang et al. Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination. In Proceedings of ACM NOSSDAV, 2001.