{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:48:05Z","timestamp":1725612485171},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290681"},{"type":"electronic","value":"9783540319061"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11558989_16","type":"book-chapter","created":{"date-parts":[[2005,11,2]],"date-time":"2005-11-02T03:51:51Z","timestamp":1130903511000},"page":"173-181","source":"Crossref","is-referenced-by-count":15,"title":["Practical Locality-Awareness for Large Scale Information Sharing"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankur","family":"Badola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Bickson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharad","family":"Maloo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saar","family":"Ron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: The Sixteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2004) (2004","DOI":"10.1145\/1007912.1007916"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/956993.956995","volume":"33","author":"B. Chun","year":"2003","unstructured":"Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: Planetlab: an overlay testbed for broad-coverage services. SIGCOMM Comput. Commun. Rev.\u00a033(3), 3\u201312 (2003)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"16_CR3","unstructured":"Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), Lihue, Hawaii, May 2003, pp. 7\u201312 (2003)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I. Gupta","year":"2003","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P. Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 53. Springer, Heidelberg (2002)"},{"key":"16_CR6","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a dht. Technical Report Technical Report UCB\/\/CSD-03-1299, The University of California, Berkeley (December 2003)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems IV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11558989_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:29:28Z","timestamp":1558283368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11558989_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290681","9783540319061"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11558989_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}