{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:13:15Z","timestamp":1742397195571},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242529"},{"type":"electronic","value":"9783540301837"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30183-7_9","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T19:38:18Z","timestamp":1285270698000},"page":"87-99","source":"Crossref","is-referenced-by-count":52,"title":["Comparing the Performance of Distributed Hash Tables Under Churn"],"prefix":"10.1007","author":[{"given":"Jinyang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Stribling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomer M.","family":"Gil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Morris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Frans","family":"Kaashoek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. Tech. Rep. MSR-TR-2003-94, Microsoft Research (December 2003)","key":"9_CR1","DOI":"10.1109\/DSN.2004.1311872"},{"doi-asserted-by":"crossref","unstructured":"Gummadi, K.P., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the 2003 ACM SIGCOMM, Karlsruhe, Germany (August 2003)","key":"9_CR2","DOI":"10.1145\/863955.863998"},{"doi-asserted-by":"crossref","unstructured":"Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating latency between arbitrary Internet end hosts. In: Proceedings of the 2002 SIGCOMM Internet Measurement Workshop, Marseille, France (November 2002)","key":"9_CR3","DOI":"10.1145\/637201.637203"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00530-003-0088-1","volume":"9","author":"P.K. Gummadi","year":"2003","unstructured":"Gummadi, P.K., Saroiu, S., Gribble, S.: A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems. Multimedia Systems Journal\u00a09(2), 170\u2013184 (2003)","journal-title":"Multimedia Systems Journal"},{"unstructured":"Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Proceedings of the Ninth Workshop on Hot Topics in Operating Systems (May 2003)","key":"9_CR5"},{"key":"9_CR6","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":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"M.F. Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing (August 2002)","key":"9_CR8","DOI":"10.1145\/571825.571863"},{"doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable dynamic emulation of the butterfly. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing (August 2002)","key":"9_CR9","DOI":"10.1145\/571825.571857"},{"key":"9_CR10","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)"},{"unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. Tech. Rep. UCB\/CSD-3-1299, UC Berkeley, Computer Science Division (December 2003)","key":"9_CR11"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_5","volume-title":"Peer-to-Peer Systems II","author":"S. Rhea","year":"2003","unstructured":"Rhea, S., Roscoe, T., Kubiatowicz, J.: Structured peer-to-peer overlays need application-driven benchmarks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"9_CR13","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, p. 329. Springer, Heidelberg (2001)"},{"doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Transactions on Networking, 149\u2013160 (2002)","key":"9_CR14","DOI":"10.1145\/964723.383071"},{"doi-asserted-by":"crossref","unstructured":"Xu, J.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proceedings of the IEEE Infocom (March 2003)","key":"9_CR15","DOI":"10.1109\/INFCOM.2003.1209238"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/JSAC.2003.818784","volume":"22","author":"B.Y. Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications\u00a022(1), 41\u201353 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Peer-to-Peer Systems III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30183-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:46:10Z","timestamp":1605761170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30183-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242529","9783540301837"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30183-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}