{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:58:44Z","timestamp":1648738724378},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T00:00:00Z","timestamp":1193270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00224-007-9074-x","type":"journal-article","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T14:17:51Z","timestamp":1193235471000},"page":"43-63","source":"Crossref","is-referenced-by-count":3,"title":["Degree-Optimal Routing for P2P Systems"],"prefix":"10.1007","volume":"45","author":[{"given":"Giovanni","family":"Chiola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennaro","family":"Cordasco","sequence":"additional","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","published-online":{"date-parts":[[2007,10,25]]},"reference":[{"key":"9074_CR1","unstructured":"Aspnes, J., Shah, G.: Skip graphs. In: Proc. of 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201903), pp.\u00a0384\u2013393 (Jan. 2003)"},{"key":"9074_CR2","doi-asserted-by":"crossref","unstructured":"Chiola, G., Cordasco, G., Gargano, L., Negro, A., Scarano, V.: Overlay networks with class. In: Proc. of 8th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN\u201905), Las Vegas, Nevada, USA, pp.\u00a0241\u2013247. IEEE Computer Society (Dec. 2005)","DOI":"10.1109\/ISPAN.2005.66"},{"key":"9074_CR3","first-page":"395","volume-title":"Proc. of 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC\u201904) (Brief Announcement)","author":"G. Cordasco","year":"2004","unstructured":"Cordasco, G., Gargano, L., Hammar, M., Scarano, V.: Brief announcement: degree-optimal deterministic routing for P2P systems. In: Proc. of 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC\u201904) (Brief Announcement), St. John\u2019s, Newfoundland, Canada, p.\u00a0395. ACM Press, New York (Jul. 2004)"},{"key":"9074_CR4","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Gargano, L., Hammar, M., Scarano, V.: Degree-optimal deterministic routing for P2P systems. In: Proc. of 10th IEEE Symposium on Computers and Communications (ISCC \u201905), La Manga del Mar Menor, Cartagena, Spain, pp.\u00a0158\u2013163. IEEE Computer Society (Jun. 2005)","DOI":"10.1109\/ISCC.2005.45"},{"key":"9074_CR5","first-page":"329","volume-title":"Proc. of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware\u201901)","author":"P. Druschel","year":"2001","unstructured":"Druschel, P., Rowstron, A.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Proc. of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware\u201901), Heidelberg, Germany, pp.\u00a0329\u2013350. Springer, New York (Nov. 2001)"},{"issue":"1","key":"9074_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.tcs.2005.12.006","volume":"355","author":"P. Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gauron, P.: D2B: a de Bruijn based content-addressable network. Int. J. Theor. Comput. Sci. 355(1), 65\u201379 (2006)","journal-title":"Int. J. Theor. Comput. Sci."},{"key":"9074_CR7","first-page":"176","volume-title":"Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201904)","author":"P. Ganesan","year":"2004","unstructured":"Ganesan, P., Manku, G.S.: Optimal routing in chord. In: Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201904), New Orleans, LA, USA, pp.\u00a0176\u2013185. Springer, New York (Jan. 2004)"},{"key":"9074_CR8","doi-asserted-by":"crossref","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: a simple degree-optimal distributed hash table. In: Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS \u201903), Berkeley, CA, USA. Lecture Notes in Computer Science, pp.\u00a098\u2013107 (Feb. 2003)","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"9074_CR9","first-page":"654","volume-title":"Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC\u201997)","author":"D.R. Karger","year":"1997","unstructured":"Karger, D.R., Lehman, E., Leighton, F.T., Panigrahy, R., Levine, M.S., Lewin, D.: Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web. In: Proc. of the 29th Annual ACM Symposium on Theory of Computing (STOC\u201997), El Paso, TX, USA, pp.\u00a0654\u2013663. ACM Press, New York (May 1997)"},{"key":"9074_CR10","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/ICNP.2003.1249776","volume-title":"Proc. of 11th IEEE International Conference on Network Protocols (ICNP \u201903)","author":"A. Kumar","year":"2003","unstructured":"Kumar, A., Merugu, S., Xu, J.(J.), Yu, X.: Ulysses: a robust, low-diameter, low-latency peer-to-peer network. In: Proc. of 11th IEEE International Conference on Network Protocols (ICNP \u201903), pp.\u00a0258\u2013267. IEEE, New York (Nov. 2003)"},{"key":"9074_CR11","unstructured":"Manku, G.S.: The power of lookahead in small-world routing networks. Technical Report, Computer Science Department, Stanford University, CA, USA (Nov. 2003)"},{"key":"9074_CR12","unstructured":"Manku, G.S., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: Proc. of 4th USENIX Symposium on Internet Technologies and Systems (USITS\u201903) (Mar. 2003)"},{"key":"9074_CR13","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 36th Annual ACM Symposium on Theory of Computing (STOC \u201904), Chicago, IL, USA, pp.\u00a054\u201363 (Jun. 2004)","DOI":"10.1145\/1007352.1007368"},{"key":"9074_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"9074_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Proc. of 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA \u201903), San Diego, CA, USA, pp.\u00a050\u201359 (Jun. 2003)","DOI":"10.1145\/777417.777421"},{"key":"9074_CR16","unstructured":"National Institute of Standards and Technology, Secure Hash Standard (NIST). http:\/\/www.itl.nist.gov\/fipspubs\/fip180-1.htm"},{"key":"9074_CR17","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. of ACM Special Interest Group on Data Communication (ACM SIGCOMM\u201901), San Diego, CA, USA, pp.\u00a0161\u2013172 (Aug. 2001)","DOI":"10.1145\/383059.383072"},{"key":"9074_CR18","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: some open questions. In: Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS\u201902), Cambridge, CA, USA, pp.\u00a045\u201352 (Mar. 2002)","DOI":"10.1007\/3-540-45748-8_4"},{"issue":"1","key":"9074_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","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. Netw. (TON) 11(1), 17\u201332 (Feb. 2003)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"issue":"1","key":"9074_CR20","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/JSAC.2003.818805","volume":"22","author":"J. Xu","year":"2004","unstructured":"Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J. Sel. Areas Commun. 22(1), 151\u2013163 (Jan. 2004) (A preliminary version appeared in the Proc. of IEEE INFOCOM\u201903)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9074_CR21","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Tech. Report No.\u00a0UCB\/CSD-01-1141, Computer Science Division (EECS), University of California at Berkeley, CA, USA (Apr. 2001)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9074-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9074-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9074-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9074-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,25]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9074"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9074-x","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,25]]}}}