Disjoint Lookups in Kademlia for Random IDs

Kademlia is the de-facto standard in self-organizing overlay network protocols today. The data structures and procedures defined by the Kademlia protocol are the same for each node. The interaction between nodes Decision-making takes place at node-level with a network usable for data storage and lookup emerging as a result. One of the main tasks within Kademlia is the lookup of resources like a target node or stored data by a source node. In this paper we present a model for generationg network graphs that contain paths between two nodes that are usable by a Kademlia lookup procedure. We use these graphs to compare the lookup success of the original Kademlia lookup procedure with a parallel lookup using multiple node-disjoint paths in the face of stale routing table entries without the need for running network simulations or a real-life Kademlia network.