{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:49Z","timestamp":1794381109847,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229247","type":"print"},{"value":"9783540278665","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27866-5_143","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:20:42Z","timestamp":1284654042000},"page":"1060-1067","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Carton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valentin","family":"Mesaros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"143_CR1","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer- To-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383071"},{"key":"143_CR2","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: ICDSP (November 2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"143_CR3","unstructured":"Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-tolerantWidearea Location and Routing. Technical Report CSD-011141, U.C. Berkeley (April 2001)"},{"key":"143_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"F. Kaashoek","year":"2003","unstructured":"Kaashoek, F., Karger, D.: Koorde: A Simple Degree-optimal Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"143_CR5","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel Architectures for P2P Applications: the Continous-Discrete Approach. In: ACM SPAA (June 2003)","DOI":"10.1145\/777412.777421"},{"key":"143_CR6","unstructured":"El-Ansary, S., Onana, L., et al.: A Framework for Peer-to-Peer Lookup Services based on k-ary Search. Technical Report TR-2002-06, SICS (May 2002)"},{"key":"143_CR7","unstructured":"Onana, L., El-Ansary, S., et al.: DKS(N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications. In: CCGRID 2003 (May 2003)"},{"key":"143_CR8","doi-asserted-by":"crossref","unstructured":"Carton, B., Mesaros, V., Van Roy, P.: Improving the Scalability of Logarithmic-Degree Peer-to-Peer Networks. Technical Report RR-2004-01, UC-Louvain (January 2004)","DOI":"10.1007\/978-3-540-27866-5_143"},{"key":"143_CR9","doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., et al.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: SIGCOMM (August 2003)","DOI":"10.1145\/863955.863999"},{"key":"143_CR10","unstructured":"P2PS v 1.0, Peer-to-Peer System Library, Universtit\u00e9 catholique de Louvain, and CETIC, Belgium (October 2003), \n                    \n                      http:\/\/www.mozart-oz.org\/mogul\/info\/cetic_ucl\/p2ps.html"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2004 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27866-5_143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T08:32:22Z","timestamp":1589877142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27866-5_143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229247","9783540278665"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27866-5_143","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99409","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}