Applying Harary Graph Structures to the Overlay Network Kademlia

Connectivity is an important property of fully distributed networks. The greater the number of node-disjoint connections between two nodes, the greater the effort an attacker has to make to reliably disconnect them. In this paper, we propose and evaluate “Consecutive s-Cliques” (CSC), which extends the routing tables in fully distributed networks managed by the Kademlia protocol with Harary graph structures. Harary graphs are undirected graphs that can be parameterized to contain the minimum number of edges necessary for being s-vertex-connected. The goal is to reach a greater connectivity than a Kademlia overlay network would typically have for a comparable routing table size, without significantly impeding the network performance in terms of routing, data storage, and data retrieval.