{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T06:41:29Z","timestamp":1790750489230,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441793","type":"print"},{"value":"9783540457480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45748-8_29","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T12:29:16Z","timestamp":1191932956000},"page":"306-318","source":"Crossref","is-referenced-by-count":108,"title":["Dynamic Replica Placement for Scalable Content Delivery"],"prefix":"10.1007","author":[{"given":"Yan","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Randy H.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John D.","family":"Kubiatowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"29_CR1","unstructured":"Y. Chawathe, S. McCanne, and E. Brewer. RMX: Reliable multicast for heterogeneous networks. In Proceedings of IEEE INFOCOM, 2000."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Y. Chu, S. Rao, and H. Zhang.A case for end system multicast. In Proceedings of ACM SIGMETRICS, June 2000.","DOI":"10.1145\/339331.339337"},{"key":"29_CR3","unstructured":"P. Francis. Yoid: Your own Internet distribution. Technical report, ACIRI, http:\/\/www.aciri.org\/yoid , April, 2000."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"J. D. Guyton and M. F. Schwartz. Experiences with a survey tool for discovering network time protocol servers. In Proc. of USENIX, 1994.","DOI":"10.21236\/ADA453548"},{"key":"29_CR5","unstructured":"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."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"S. Jamin, C. Jin, A. Kurc, D. Raz, and Y. Shavitt. Constrained mirror placement on the Internet. In Proceedings of IEEE Infocom, 2001.","DOI":"10.1109\/INFCOM.2001.916684"},{"key":"29_CR7","unstructured":"J. Jannotti et al. Overcast: Reliable multicastingw ith an overlay network. In Proceedings of OSDI, 2000."},{"key":"29_CR8","unstructured":"Mirror Image Internet Inc. http:\/\/www.mirror-image.com ."},{"key":"29_CR9","unstructured":"D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel. ALMI: An application level multicast infrastructure. In Proceedings of 3rd USITS, 2001."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/258492.258523"},{"key":"29_CR11","unstructured":"L. Qiu, V. N. Padmanabhan, and G. Voelker. On the placement of Web server replicas. In Proceedings of IEEE Infocom, 2001."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, 2001.","DOI":"10.1145\/383059.383072"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"P. Rodriguez and S. Sibal. SPREAD: Scaleable platform for reliable and efficient automated distribution. In Proceedings of WWW, 2000.","DOI":"10.1016\/S1389-1286(00)00086-4"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routingfor large-scale peer-to-peer systems. In Proc. of Middleware 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"29_CR15","unstructured":"Speedera Inc. http:\/\/www.speedera.com ."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"I. Stoica et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of ACM SIGCOMM, 2001.","DOI":"10.1145\/383059.383071"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an Internetwork. In Proceedings of IEEE INFOCOM, 1996.","DOI":"10.1109\/INFCOM.1996.493353"},{"key":"29_CR18","unstructured":"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."},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"S. Q. Zhuang et al. Bayeux: An architecture for scalable and fault-tolerant widearea data dissemination. In Proceedings of ACM NOSSDAV, 2001.","DOI":"10.1145\/378344.378347"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45748-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:49:54Z","timestamp":1556902194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45748-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441793","9783540457480"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45748-8_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}