{"id":"https://openalex.org/W2034320333","doi":"https://doi.org/10.1109/infcom.2013.6566846","title":"A contribution to analyzing and enhancing Darknet routing","display_name":"A contribution to analyzing and enhancing Darknet routing","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2034320333","doi":"https://doi.org/10.1109/infcom.2013.6566846","mag":"2034320333"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2013.6566846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040821728","display_name":"Stefanie Roos","orcid":"https://orcid.org/0009-0000-8168-8983"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefanie Roos","raw_affiliation_strings":["Technical University Darmstadt, Germany","TU Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"TU Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053465128","display_name":"Thorsten Strufe","orcid":"https://orcid.org/0000-0002-8723-9692"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten Strufe","raw_affiliation_strings":["Technical University Darmstadt, Germany","TU Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"TU Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":1.8781,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86515841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"615","last_page":"619"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.819621205329895},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6557173728942871},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6241597533226013},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.619296133518219},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5808715224266052},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5438310503959656},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5358221530914307},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.47022318840026855},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4494681656360626},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4386473596096039},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4367585778236389},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4311748147010803}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.819621205329895},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6557173728942871},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6241597533226013},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.619296133518219},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5808715224266052},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5438310503959656},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5358221530914307},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.47022318840026855},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4494681656360626},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4386473596096039},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4367585778236389},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4311748147010803}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2013.6566846","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2013.6566846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.392.7119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.7119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_P2P/share/INFOCOM.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1513751655","https://openalex.org/W1650252156","https://openalex.org/W2025849595","https://openalex.org/W2128678576","https://openalex.org/W2136347453","https://openalex.org/W2144485270","https://openalex.org/W2166570842","https://openalex.org/W2260643417","https://openalex.org/W2520602384","https://openalex.org/W6630972833","https://openalex.org/W6636915500","https://openalex.org/W6692518877"],"related_works":["https://openalex.org/W2944616377","https://openalex.org/W2286025681","https://openalex.org/W2251995179","https://openalex.org/W4253436398","https://openalex.org/W2148093630","https://openalex.org/W2556128816","https://openalex.org/W4377970799","https://openalex.org/W153071365","https://openalex.org/W2613682624","https://openalex.org/W2607223747"],"abstract_inverted_index":{"Routing":[0],"in":[1],"Darknets,":[2],"membership":[3],"concealing":[4],"overlays":[5],"for":[6,10,31,79],"pseudonymous":[7],"communication,":[8],"like":[9],"instance":[11],"Freenet,":[12],"is":[13],"insufficiently":[14],"analyzed,":[15],"barely":[16],"understood,":[17],"and":[18,41],"highly":[19],"inefficient.":[20],"These":[21],"systems":[22],"at":[23],"higher":[24],"performance":[25,76],"are":[26],"promising":[27],"privacy":[28],"preserving":[29],"solutions":[30],"social":[32],"applications.":[33],"This":[34],"paper":[35],"contributes":[36],"a":[37,42,74],"realistic":[38,80],"analytical":[39],"model":[40],"novel":[43],"routing":[44,50],"algorithm":[45,72],"with":[46],"provable":[47],"polylog":[48],"expected":[49],"length.":[51],"Using":[52],"the":[53],"model,":[54],"we":[55],"additionally":[56],"prove":[57],"that":[58,69],"this":[59],"can":[60],"not":[61],"be":[62],"achieved":[63],"by":[64],"Freenet's":[65],"routing.":[66],"Simulations":[67],"support":[68],"our":[70],"proposed":[71],"achieves":[73],"better":[75],"than":[77],"Freenet":[78],"network":[81],"sizes.":[82]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}