{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T04:20:48Z","timestamp":1741926048318,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642251085"},{"type":"electronic","value":"9783642251092"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25109-2_25","type":"book-chapter","created":{"date-parts":[[2011,10,29]],"date-time":"2011-10-29T06:33:52Z","timestamp":1319870032000},"page":"385-402","source":"Crossref","is-referenced-by-count":3,"title":["Combining Resource and Location Awareness in DHTs"],"prefix":"10.1007","author":[{"given":"Liz","family":"Ribe-Baumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Artigas, M.S., Lopez, P.G., Skarmeta, A.F.: A comparative study of hierarchical dht systems. In: Proceedings of the 32nd IEEE Conference on Local Computer Networks, pp. 325\u2013333 (2007)","DOI":"10.1109\/LCN.2007.79"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Artigas, M., Lopez, P., Ahullo, J., Skarmeta, A.: Cyclone: A novel design schema for hierarchical dhts. In: IEEE P2P 2005, pp. 49\u201356 (2005)","DOI":"10.1109\/P2P.2005.5"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: Supporting scalable multi-attribute range queries. In: SIGCOMM 2004, pp. 353\u2013366 (2004)","DOI":"10.1145\/1015467.1015507"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/1-4020-2258-1_16","volume-title":"Web Content Caching and Distribution","author":"F. Bustamante","year":"2004","unstructured":"Bustamante, F., Qiao, Y.: Friendships that last: Peer lifespan and its role in p2p protocols. In: Douglis, F., Davison, B. (eds.) Web Content Caching and Distribution, pp. 233\u2013246. Springer, Netherlands (2004)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: SIGCOMM 2004, pp. 15\u201326 (2004)","DOI":"10.1145\/1015467.1015471"},{"key":"25_CR6","unstructured":"Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a dht for low latency and high throughput. In: Proceedings of the 1st NSDI, pp. 85\u201398 (2004)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"El Dick, M., Pacitti, E., Kemme, B.: Flower-cdn: A hybrid p2p overlay for efficient query processing in cdn. In: EDBT 2009, pp. 427\u2013438 (2009)","DOI":"10.1145\/1516360.1516410"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Bawa, M., Garcia-Molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB 2004, pp. 444\u2013455 (2004)","DOI":"10.1016\/B978-012088469-8.50041-3"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Gummadi, K., Garcia-Molina, H.: Canon in g major: Designing dhts with hierarchical structure. In: ICDCS 2004, pp. 263\u2013272 (2004)","DOI":"10.1109\/ICDCS.2004.1281591"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1007\/978-3-540-45209-6_166","volume-title":"Euro-Par 2003 Parallel Processing","author":"L. Garc\u00e9s-Erice","year":"2003","unstructured":"Garc\u00e9s-Erice, L., Biersack, E.W., Felber, P., Ross, K.W., Urvoy-Keller, G.: Hierarchical Peer-to-Peer Systems. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 1230\u20131239. Springer, Heidelberg (2003)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Godfrey, P.B., Stoica, I.: Heterogeneity and load balance in distributed hash tables. In: IEEE INFOCOM, pp. 596\u2013606 (2005)","DOI":"10.1109\/INFCOM.2005.1497926"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of dht routing geometry on resilience and proximity. In: SIGCOMM 2003, pp. 381\u2013394 (2003)","DOI":"10.1145\/863955.863998"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Baumgart, I., Heep, B., Krause, S.: Oversim: A scalable and flexible overlay framework for simulation and real network applications. In: IEEE P2P (2009), http:\/\/www.oversim.org\/wiki","DOI":"10.1109\/P2P.2009.5284505"},{"key":"25_CR14","doi-asserted-by":"crossref","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: STOC, pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Simple efficient load balancing algorithms for peer-to-peer systems. In: SPAA 2004, pp. 36\u201343 (2004)","DOI":"10.1145\/1007912.1007919"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Maniymaran, B., Bertier, M., Kermarrec, A.-M.: Build one, get one free: Leveraging the coexistence of multiple p2p overlay networks. In: ICDCS 2007, pp. 33\u201333 (June 2007)","DOI":"10.1109\/ICDCS.2007.88"},{"key":"25_CR17","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., Mazi\u00e8res, 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, pp. 53\u201365. Springer, Heidelberg (2002)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: SIGCOMM 2001 (2001)","DOI":"10.1145\/383059.383072"},{"key":"25_CR19","unstructured":"Ren, S., Guo, L., Jiang, S., Zhang, X.: Sat-match: A self-adaptive topology matching method to achieve low lookup latency in structured p2p overlay networks. In: IPDPS 2004, pp. 83\u201391 (April 2004)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of the Multimedia Computing and Networking (2002)","DOI":"10.1117\/12.449977"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001, pp. 149\u2013160 (2001)","DOI":"10.1145\/383059.383071"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/774763.774779","volume":"33","author":"M. Waldvogel","year":"2003","unstructured":"Waldvogel, M., Rinaldi, R.: Efficient topology-aware overlay network. SIGCOMM Comput. Commun. Rev.\u00a033, 101\u2013106 (2003)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Xu, Z., Min, R., Hu, Y.: Hieras: A dht based hierarchical p2p routing algorithm. In: ICPP 2003, pp. 187\u2013194 (2003)","DOI":"10.1109\/ICPP.2003.1240580"},{"key":"25_CR24","unstructured":"Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-are location and routing. Tech. Rep. UCB\/CSD-01-1141, UC Berkeley (2001)"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Zoels, S., Despotovic, Z., Kellerer, W.: Cost-based analysis of hierarchical dht design. In: IEEE P2P 2006, pp. 233\u2013239 (2006)","DOI":"10.1109\/P2P.2006.13"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems: OTM 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25109-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T12:58:20Z","timestamp":1741870700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25109-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642251085","9783642251092"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25109-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}