{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:34Z","timestamp":1740548074102,"version":"3.38.0"},"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_26","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T19:38:18Z","timestamp":1285270698000},"page":"269-277","source":"Crossref","is-referenced-by-count":29,"title":["Know Thy Neighbor\u2019s Neighbor: Better Routing for Skip-Graphs and Small Worlds"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-topeer systems. In: Proceedings of the twenty-first symposium on Principles of distributed computing (PODC), pp. 223\u2013232 (2002)","DOI":"10.1145\/571825.571862"},{"key":"26_CR2","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 384\u2013393 (2003)"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.10042","volume":"21","author":"D. Coppersmith","year":"2002","unstructured":"Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Structures and Algorithms\u00a021(1), 1\u201313 (2002)","journal-title":"Random Structures and Algorithms"},{"key":"26_CR4","unstructured":"Fraigniaud, P., Gauron, P.: The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud (2003)"},{"key":"26_CR5","unstructured":"Ganesan, P., Manku, G.S.: Optimal routing in chord. In: Fifteenth ACM SIAM Symposium on Discrete Algorithms, SODA (2004)"},{"key":"26_CR6","unstructured":"Harvey, N., Dunagan, J., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS (2003)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Harvey, N., Ian Munro, J.: Deterministic skipnet. In: Twenty Second Annual ACM Syposium on Priciples of Distributed Computing (PODC), pp. 152\u2013153 (2003)","DOI":"10.1145\/872035.872057"},{"key":"26_CR8","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.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, Springer, Heidelberg (2003)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: The Small-World phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, STOC (2000)","DOI":"10.1145\/335305.335325"},{"key":"26_CR10","unstructured":"Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS (2003)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor\u2019s neighbor: the power of lookahead in randomized p2p networks. In: STOC (2004)","DOI":"10.1145\/1007352.1007368"},{"key":"26_CR12","unstructured":"Minsky, Y., Trachtenberg, A.: Practical set reconciliation. Technical Report 2002-03, Boston University (2002)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures SPAA, pp. 50\u201359 (2003)","DOI":"10.1145\/777417.777421"},{"key":"26_CR14","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, decentralized 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)"},{"key":"26_CR15","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, F.D.H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. Technical Report TR-819, MIT LCS (2001)"},{"key":"26_CR16","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB\/CSD-01-1141, UC Berkeley (April 2001)"}],"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_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:58:20Z","timestamp":1740531500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30183-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242529","9783540301837"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30183-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}