{"id":"https://openalex.org/W3197358298","doi":"https://doi.org/10.1109/icccn52240.2021.9522261","title":"Applying Harary Graph Structures to the Overlay Network Kademlia","display_name":"Applying Harary Graph Structures to the Overlay Network Kademlia","publication_year":2021,"publication_date":"2021-07-01","ids":{"openalex":"https://openalex.org/W3197358298","doi":"https://doi.org/10.1109/icccn52240.2021.9522261","mag":"3197358298"},"language":"en","primary_location":{"id":"doi:10.1109/icccn52240.2021.9522261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn52240.2021.9522261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Computer Communications and Networks (ICCCN)","raw_type":"proceedings-article"},"type":"article","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/A5024732148","display_name":"Henner Heck","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Henner Heck","raw_affiliation_strings":["Privacy and Compliance, Universit\u00e4t der Bundeswehr M\u00fcnchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Privacy and Compliance, Universit\u00e4t der Bundeswehr M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I40527276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058997869","display_name":"Arno Wacker","orcid":null},"institutions":[{"id":"https://openalex.org/I40527276","display_name":"Universit\u00e4t der Bundeswehr M\u00fcnchen","ror":"https://ror.org/05kkv3f82","country_code":"DE","type":"education","lineage":["https://openalex.org/I1315109972","https://openalex.org/I40527276","https://openalex.org/I4387152969"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arno Wacker","raw_affiliation_strings":["Privacy and Compliance, Universit\u00e4t der Bundeswehr M\u00fcnchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Privacy and Compliance, Universit\u00e4t der Bundeswehr M\u00fcnchen, Munich, Germany","institution_ids":["https://openalex.org/I40527276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024732148"],"corresponding_institution_ids":["https://openalex.org/I40527276"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14879618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9998000264167786,"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.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9914000034332275,"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.7908908128738403},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.59485924243927},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5607753396034241},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5209102034568787},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4817250072956085},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.48011112213134766},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4630029499530792},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4226975440979004},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4087936580181122},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36778903007507324},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36500829458236694},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.33168500661849976},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32421889901161194},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19775232672691345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18176674842834473},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17822754383087158},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.07232195138931274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7908908128738403},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.59485924243927},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5607753396034241},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5209102034568787},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4817250072956085},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.48011112213134766},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4630029499530792},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4226975440979004},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4087936580181122},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36778903007507324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36500829458236694},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.33168500661849976},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32421889901161194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19775232672691345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18176674842834473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17822754383087158},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.07232195138931274},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn52240.2021.9522261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn52240.2021.9522261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Conference on Computer Communications and Networks (ICCCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1602845237","https://openalex.org/W1605512838","https://openalex.org/W1655958391","https://openalex.org/W1844290941","https://openalex.org/W1987153375","https://openalex.org/W2004075592","https://openalex.org/W2030852433","https://openalex.org/W2105599110","https://openalex.org/W2119245106","https://openalex.org/W2125993726","https://openalex.org/W2128368884","https://openalex.org/W2158049821","https://openalex.org/W2167898414","https://openalex.org/W2278335717","https://openalex.org/W2604792169","https://openalex.org/W2752066938","https://openalex.org/W2770019680","https://openalex.org/W2807574766","https://openalex.org/W4250390143","https://openalex.org/W6695009093"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W12027773","https://openalex.org/W2290341137","https://openalex.org/W2130383043"],"abstract_inverted_index":{"Connectivity":[0],"is":[1,82],"an":[2,23],"important":[3],"property":[4],"of":[5,13,74,110],"fully":[6,48],"distributed":[7,49],"networks.":[8],"The":[9,80],"greater":[10,20,86],"the":[11,19,21,44,53,71,105],"number":[12,73],"node-disjoint":[14],"connections":[15],"between":[16],"two":[17],"nodes,":[18],"effort":[22],"attacker":[24],"has":[25],"to":[26,28,69,83],"make":[27],"reliably":[29],"disconnect":[30],"them.":[31],"In":[32],"this":[33],"paper,":[34],"we":[35],"propose":[36],"and":[37,114],"evaluate":[38],"\u201cConsecutive":[39],"s-Cliques\u201d":[40],"(CSC),":[41],"which":[42],"extends":[43],"routing":[45,99],"tables":[46],"in":[47,108],"networks":[50],"managed":[51],"by":[52],"Kademlia":[54,90],"protocol":[55],"with":[56],"Harary":[57,60],"graph":[58],"structures.":[59],"graphs":[61,64],"are":[62],"undirected":[63],"that":[65],"can":[66],"be":[67],"parameterized":[68],"contain":[70],"minimum":[72],"edges":[75],"necessary":[76],"for":[77,96],"being":[78],"s-vertex-connected.":[79],"goal":[81],"reach":[84],"a":[85,89,97],"connectivity":[87],"than":[88],"overlay":[91],"network":[92,106],"would":[93],"typically":[94],"have":[95],"comparable":[98],"table":[100],"size,":[101],"without":[102],"significantly":[103],"impeding":[104],"performance":[107],"terms":[109],"routing,":[111],"data":[112,115],"storage,":[113],"retrieval.":[116]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}