Kademlia protocol as gossip enhancement

Abstract

Kademlia protocol as gossip enhancement

Інформатика, інформаційні системи та технології: тези доповідей двадцять першої всеукраїнської конференції студентів і молодих науковців. Одеса, 26 квітня 2024 р. - Одеса, 2024. – С. The objective of the given article is to consider gossip and Kademlia protocols, evaluate effectiveness of a P2P system based on a simplified gossip protocol and suggest an upgrade that can be achieved by adding Kademlia’s advantages. The Internet, and all similar networks, ask for large-scale, reliable, distributed application builders one of which is gossip, making our article highly topical. P2P, or peer-to-peer, refers to a computer network commonly used for sharing digital media files. Kademlia, an early implementation of the distributed hash-table (DHT), incorporates the XOR-based metric for constructing the network's topology [1]. This protocol organizes participating nodes into a binary tree-like structure known as the routing table. Thanks to XOR metric, Kademlia offers efficient lookup operations to find the node responsible for a specific key or retrieve stored data. Kademlia ensures that a lookup operation will locate either the correct node or the closest node to the target key within a logarithmic number of steps, making it highly scalable.