{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:39Z","timestamp":1725564819448},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_9","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T17:47:42Z","timestamp":1283708862000},"page":"89-98","source":"Crossref","is-referenced-by-count":10,"title":["F-Chord: Improved Uniform Routing on Chord"],"prefix":"10.1007","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Hammar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Negro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vittorio","family":"Scarano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Druschel, P., Rowstron, A.: Pastry: Scalable, distribute 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":"10.1007\/3-540-45518-3_18"},{"key":"9_CR2","volume-title":"Combinatorial Group testing and its applications","author":"D.-Z. Du","year":"2000","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group testing and its applications. World Scientific, Singapore (2000)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/65950.65955","volume":"36","author":"S. Kapoor","year":"1989","unstructured":"Kapoor, S., Reingold, E.M.: Optimum Lopsided Binary Trees. Journal of ACM\u00a036(3), 573\u2013590 (1989)","journal-title":"Journal of ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Kaashoek, M.F., Krager, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS (2003)","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"9_CR5","unstructured":"Ganesan, P., Manku, G.S.: Optimal Routing in Chord. In: Proc. of SODA (2004) (to appear)"},{"key":"9_CR6","volume-title":"Concrete Mathematics","author":"R. Graham","year":"1994","unstructured":"Graham, R., Patashnik, O., Knuth, D.E.: Concrete Mathematics. Addison-Wesley, Reading (1994)"},{"key":"9_CR7","unstructured":"Kumar, A., Merugu, S., Xu, J., Yu, X.: Ulysses, A Robust, Low-Diameter, Low- Latency Peer-to-peer Network. In: The Proc. of IEEE Inter. Conf. on Network Protocols (ICNP 2003), Atlanta (November 2003) (to appear)"},{"key":"9_CR8","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: Proc. of STOC (2004) (to appear)","DOI":"10.1145\/1007352.1007368"},{"key":"9_CR9","unstructured":"D. Malkhi, M. Naor, Ratajczak, V.: A Scalable and Dynamic Emulation of the Butterfly. in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Aug. 2002."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: A Simple Fault Tolerant Distributed Hash Table. In: IPTPS (February 2003)","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for p2p applications: the ontinousdiscrete approach. In: Proc. of 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA (2003)","DOI":"10.1145\/777412.777421"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-30183-7_26","volume-title":"Peer-to-Peer Systems III","author":"M. Naor","year":"2005","unstructured":"Naor, M., Wieder, U.: Know thy Neighbor\u2019s Neighbor: Better Routing for Skip- Graphs and Small Worlds. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 269\u2013277. Springer, Heidelberg (2005)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-45748-8_4","volume-title":"Peer-to-Peer Systems","author":"S. Ratnasamy","year":"2002","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 45. Springer, Heidelberg (2002)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"9_CR15","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 Trans. on Networking (2003)","DOI":"10.1109\/TNET.2002.808407"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Xu, J.: On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. In: The Proc. of IEEE INFOCOM (May 2003)","DOI":"10.1109\/INFCOM.2003.1209238"},{"key":"9_CR17","unstructured":"Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for aulttolerant wide-area location and routing. Tech. Rep. UCB\/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:21:01Z","timestamp":1605741661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}