Research on Improvement of Routing Algorithm Kademlia in IPFS

Interplanetary File System (IPFS), which was proposed in 2014, has attracted a lot of attention to the distributed field. IPFS has set off a wave of decentralized storage in the application of WEB3.0, but decentralization means less robustness and stability. In the performance measurement of IPFS network, it was found that IPFS has bottlenecks in parsing remote nodes and downloading remote objects. As the core of IPFS routing layer, Kademlia algorithm provides support for routing resolution between nodes and obtaining remote files. It is found that the network constructed by the Kademlia algorithm has a mismatch between the physical topology and the logical topology, a single route search strategy, and inaccurate node selection strategy. This paper improves Kademlia algorithm from the following three aspects, generating node ID strategy, relay node selection strategy and node lookup strategy, and conducts simulation experiments to compare other routing algorithms, verifying the superiority of this algorithm in node lookup speed and network stability.