{"date_created":"2020-10-01T09:47:54Z","user_id":"15415","citation":{"bibtex":"@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn, Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}, year={2009} }","short":"C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany, 2009.","chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","mla":"Schindelhauer, Christian, et al. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany; 2009.","apa":"Schindelhauer, C., Mahlmann, P., &#38; Janson, T. (2009). <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany."},"title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","_id":"19825","file_date_updated":"2020-10-01T09:47:33Z","department":[{"_id":"63"}],"author":[{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"last_name":"Mahlmann","full_name":"Mahlmann, Peter","first_name":"Peter"},{"last_name":"Janson","full_name":"Janson, Thomas","first_name":"Thomas"}],"abstract":[{"text":"Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.","lang":"eng"}],"publisher":"Paderborn, Germany","year":"2009","status":"public","has_accepted_license":"1","type":"report","date_updated":"2022-01-06T06:54:13Z","file":[{"file_name":"pub-hni-4130.pdf","file_id":"19826","success":1,"file_size":753215,"creator":"koala","date_created":"2020-10-01T09:47:33Z","date_updated":"2020-10-01T09:47:33Z","relation":"main_file","access_level":"closed","content_type":"application/pdf"}],"ddc":["000"],"language":[{"iso":"eng"}]}