{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:00Z","timestamp":1725559260005},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260097"},{"type":"electronic","value":"9783540320135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428589_25","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T12:23:36Z","timestamp":1279023816000},"page":"392-402","source":"Crossref","is-referenced-by-count":0,"title":["Robust Locality-Aware Lookup Networks"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30186-8_22","volume-title":"Distributed Computing","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 305\u2013319. Springer, Heidelberg (2004)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: The Sixteenth ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004 (2004)","DOI":"10.1145\/1007912.1007916"},{"key":"25_CR3","unstructured":"Abraham, I., Malkhi, D., Dobzinski, O.: LAND: Stretch (1 + \u03b5) locality aware networks for DHTs. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2004 (2004)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/777412.777442","volume-title":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures","author":"M. Arias","year":"2003","unstructured":"Arias, M., Cowen, L.J., Laing, K.A., Rajaraman, R., Taka, O.: Compact routing with name independence. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, pp. 184\u2013192. ACM Press, New York (2003)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/73007.73053","volume-title":"Proceedings of the twenty-first annual ACM symposium on Theory of computing","author":"B. Awerbuch","year":"1989","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Compact distributed data structures for adaptive routing. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, pp. 479\u2013489. ACM Press, New York (1989)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0405013","volume":"5","author":"B. Awerbuch","year":"1992","unstructured":"Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discret. Math.\u00a05(2), 151\u2013162 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","volume":"61","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing\u00a061, 679\u2013687 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Goal, A., Zhang, H., Govindan, R.: Incrementally improving lookup latency in distributed hash table systems. In: ACM Sigmetrics (2003)","DOI":"10.1145\/781027.781042"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/863955.863998","volume-title":"Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications","author":"K. Gummadi","year":"2003","unstructured":"Gummadi, K., 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 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 381\u2013394. ACM Press, New York (2003)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1145\/945445.945475","volume-title":"Proceedings of the nineteenth ACM symposium on Operating systems principles","author":"K.P. Gummadi","year":"2003","unstructured":"Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proceedings of the nineteenth ACM symposium on Operating systems principles, pp. 314\u2013329. ACM Press, New York (2003)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-39989-6_23","volume-title":"Distributed Computing","author":"K. Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, August 2002, pp. 41\u201352 (2002)","DOI":"10.1145\/564870.564877"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Li, X., Plaxton, C.G.: On name resolution in peer-to-peer networks. In: Proceedings of the 2nd ACM Worskhop on Principles of Mobile Commerce (POMC), pp. 82\u201389 (October 2002)","DOI":"10.1145\/584490.584507"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Lynch, N., Malkhi, D., Ratajczak, D.: Atomic data access in distributed hash tables. In: Proceedings of the International Peer-to-Peer Symposium (2002)","DOI":"10.1007\/3-540-45748-8_28"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183\u2013192 (2002)","DOI":"10.1145\/571825.571857"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-45172-3_8","volume-title":"Peer-to-Peer Systems II","author":"M. Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 88\u201397. Springer, Heidelberg (2003)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Plaxton, C., Rajaraman, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45748-8_26","volume-title":"Peer-to-Peer Systems","author":"J. Saia","year":"2002","unstructured":"Saia, J., Fiat, A., Gribble, S., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 270. Springer, Heidelberg (2002)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/378580.378581","volume-title":"Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pp. 1\u201310. ACM Press, New York (2001)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications (2003)","DOI":"10.1109\/JSAC.2003.818784"}],"container-title":["Lecture Notes in Computer Science","Self-star Properties in Complex Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428589_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:02:32Z","timestamp":1559264552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428589_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260097","9783540320135"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11428589_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}