{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:04Z","timestamp":1750306444118,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T00:00:00Z","timestamp":1456099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["STR 1131\/2-1"],"award-info":[{"award-number":["STR 1131\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2016,3,31]]},"abstract":"<jats:p>Darknets, membership-concealing peer-to-peer networks, suffer from high message delivery delays due to insufficient routing strategies. They form topologies restricted to a subgraph of the social network of their users by limiting connections to peers with a mutual trust relationship in real life. Whereas centralized, highly successful social networking services entail a privacy loss of their users, Darknets at higher performance represent an optimal private and censorship-resistant communication substrate for social applications.<\/jats:p>\n          <jats:p>Decentralized routing so far has been analyzed under the assumption that the network resembles a perfect lattice structure. Freenet, currently the only widely used Darknet, attempts to approximate this structure by embedding the social graph into a metric space. Considering the resulting distortion, the common greedy routing algorithm is adapted to account for local optima. Yet the impact of the adaptation has not been adequately analyzed.<\/jats:p>\n          <jats:p>\n            We thus suggest a model integrating inaccuracies in the embedding. In the context of this model, we show that the Freenet routing algorithm cannot achieve polylog performance. Consequently, we design\n            <jats:italic>NextBestOnce<\/jats:italic>\n            , a provable poylog algorithm based only on information about neighbors. Furthermore, we show that the routing length of\n            <jats:italic>NextBestOnce<\/jats:italic>\n            is further decreased by more than a constant factor if neighbor-of-neighbor information is included in the decision process.\n          <\/jats:p>","DOI":"10.1145\/2809779","type":"journal-article","created":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T22:27:38Z","timestamp":1463869658000},"page":"1-30","source":"Crossref","is-referenced-by-count":1,"title":["Dealing with Dead Ends"],"prefix":"10.1145","volume":"1","author":[{"given":"Stefanie","family":"Roos","sequence":"first","affiliation":[{"name":"TU Dresden, Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Strufe","sequence":"additional","affiliation":[{"name":"TU Dresden, Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,22]]},"reference":[{"volume-title":"Le Hung Vu, and Anwitaman Datta","year":"2009","author":"Buchegger Sonja","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_1_3_1","unstructured":"Ian Clarke Oskar Sandberg Matthew Toseland and Vilhelm Verendel. 2010. Private Communication Through a Network of Trusted Connections: The Dark Freenet. Retrieved from http:\/\/freenetproject.org\/ papers.html.  Ian Clarke Oskar Sandberg Matthew Toseland and Vilhelm Verendel. 2010. Private Communication Through a Network of Trusted Connections: The Dark Freenet. Retrieved from http:\/\/freenetproject.org\/ papers.html."},{"volume-title":"Proceedings of the International Workshop on Design Issues in Anonymity and Unobservability.","author":"Clarke Ian","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1688899.1688918"},{"volume-title":"Proceedings of the 5th International Conference on Network and System Security (NSS\u201911)","author":"Nathan","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582755"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993689"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/NetSys.2013.23"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851198"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_75"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007368"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653733"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653683"},{"volume-title":"Proceedings of the 19th Annual Network & Distributed System Security Symposium (NDSS&rsquo;\u201912)","year":"2012","author":"Mittal Prateek","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382210"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653681"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11861386_24"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2012.24"},{"volume-title":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM\u201913)","year":"2013","author":"Roos Stefanie","key":"e_1_2_1_23_1"},{"volume-title":"On the impossibility of efficient self-stabilization in virtual overlays with churn","author":"Roos Stefanie","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDSW.2011.19"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2014.6997510"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653709"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2809779","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2809779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:42:54Z","timestamp":1750225374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2809779"}},"subtitle":["Efficient Routing in Darknets"],"short-title":[],"issued":{"date-parts":[[2016,2,22]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3,31]]}},"alternative-id":["10.1145\/2809779"],"URL":"https:\/\/doi.org\/10.1145\/2809779","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2016,2,22]]}}}