{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T17:09:30Z","timestamp":1742404170934},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icnp.2003.1249752","type":"proceedings-article","created":{"date-parts":[[2004,6,21]],"date-time":"2004-06-21T21:52:40Z","timestamp":1087854760000},"page":"6-15","source":"Crossref","is-referenced-by-count":0,"title":["Distributed, self-stabilizing placement of replicated resources in emerging networks"],"prefix":"10.1109","author":[{"family":"Bong-Jun Ko","sequence":"first","affiliation":[]},{"given":"D.","family":"Rubenstein","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1117\/12.475279"},{"key":"ref11","article-title":"Replica placement for emerging networks via an asynchronous, decentralized, graph-coloring algorithm","author":"ko","year":"2003","journal-title":"Technical Report"},{"key":"ref12","article-title":"Replication Strategies in Unstructured Peer-to-Peer Networks","author":"qiu","year":"2002","journal-title":"Proceedings of the SIGCOMM '01 ACM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258600"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301257"},{"journal-title":"Gnutella","year":"0","key":"ref6"},{"journal-title":"The Grid Blueprint for a New Computing Infrastructure","year":"1999","author":"foster","key":"ref5"},{"key":"ref8","article-title":"Greedy strikes back: Improved facility location algorithms","author":"guha","year":"1998","journal-title":"Symposium on Discrete Algorithms (SODA)"},{"key":"ref7","first-page":"769","article-title":"Reductions among high dimensional proximity problems","author":"goel","year":"2001","journal-title":"Symposium on Discrete Algorithms (SODA)"},{"key":"ref2","article-title":"Approximation algorithms for data placement in arbitrary networks","author":"baev","year":"2001","journal-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"journal-title":"Personal communication","year":"0","author":"adler","key":"ref1"},{"journal-title":"Optimal Content Replication in P2P Communities in submission","year":"2002","author":"kangasharju","key":"ref9"}],"event":{"name":". 11th IEEE International Conference on Network Protocols","acronym":"ICNP-03","location":"Atlanta, GA, USA"},"container-title":["11th IEEE International Conference on Network Protocols, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8838\/27972\/01249752.pdf?arnumber=1249752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T18:46:47Z","timestamp":1489430807000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1249752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icnp.2003.1249752","relation":{},"subject":[]}}