{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:54:29Z","timestamp":1747810469315},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icdcs.2004.1281582","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T10:19:45Z","timestamp":1086862785000},"source":"Crossref","is-referenced-by-count":148,"title":["PIC: practical Internet coordinates for distance estimation"],"prefix":"10.1109","author":[{"given":"M.","family":"Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Rowstron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Key","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","article-title":"Tapestry: An infrastructure for fault-resilient wide-area location and routing","author":"zhao","year":"2001","journal-title":"Technical Report UCB\/\/CSD-01&#x2013;1141"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1145\/564870.564877","article-title":"Dis-tribted data location in a dynamic network","author":"hildrum","year":"2002","journal-title":"SPAA '02"},{"key":"ref13","article-title":"Routing information organization to support scalable interdomain routing with heterogeneous path require-ments","author":"hotz","year":"1996"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/345063.339337","article-title":"A case for end system multicast","author":"chu","year":"2000","journal-title":"Proc of ACM SIGMETRICS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383073"},{"key":"ref19","article-title":"Lighthouses for scalable distributed location","author":"pias","year":"2003","journal-title":"IPTPS'03"},{"key":"ref28","article-title":"Efficient topology-aware overlay network","author":"waldvogel","year":"2002","journal-title":"HotNets"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945474"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916262"},{"key":"ref3","article-title":"Proximity neighbor selection in tree-based structurd peer-to-peer overlays","author":"castro","year":"2003","journal-title":"Technical Report MSR-TR-2003&#x2013;85"},{"key":"ref6","article-title":"Scalable application-level anycast for highly dynamic groups","author":"castro","year":"2003","journal-title":"NGC'2003"},{"key":"ref29","article-title":"How to model an internetwork","author":"zegura","year":"1996","journal-title":"Infocom96"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.803069"},{"key":"ref8","article-title":"Prac-tical, distributed network coordinates","author":"cox","year":"2003","journal-title":"HotNets-II"},{"key":"ref7","article-title":"An evaluation of scalable application-level multicast built using peer-to-peer overlay networks","author":"castro","year":"2003","journal-title":"Proc 22nt IEEE INFOCOM"},{"key":"ref2","article-title":"Exploiting network proximity in peer-to-peer overlay networks","author":"castro","year":"2002","journal-title":"Technical report MSR-TR-2002&#x2013;37"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749285"},{"key":"ref1","article-title":"Performance and dependability of structured peer-to-peer overlays","author":"castro","year":"2003","journal-title":"Microsoft Research Tech Rep MSR-TR"},{"key":"ref20","first-page":"311","article-title":"Accessing nearby copies of replicated objects in a distributed environ-ment","author":"plaxton","year":"1997","journal-title":"Proc 9th ACM Symp on Parallel Algorithms and Architectures"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45518-3_18","article-title":"Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer sys-tems","author":"rowstron","year":"2001","journal-title":"Proc IFIP\/ACM Middleware 2001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019369"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"ref25","article-title":"A measurement study of peer-to-peer file sharing systems","author":"saroiu","year":"2002","journal-title":"MMCN"}],"event":{"name":"24th International Conference on Distributed Computing Systems, 2004. Proceedings.","location":"Tokyo, Japan","start":{"date-parts":[[2004,3,26]]},"end":{"date-parts":[[2004,3,26]]}},"container-title":["24th International Conference on Distributed Computing Systems, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9016\/28619\/01281582.pdf?arnumber=1281582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T03:56:27Z","timestamp":1497585387000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1281582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icdcs.2004.1281582","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}