Research Article
Random Node Sampling in Kademlia
@INPROCEEDINGS{10.4108/ICST.BROADNETS2009.7239, author={Zolt\^{a}n Nov\^{a}k and Zolt\^{a}n Pap}, title={Random Node Sampling in Kademlia}, proceedings={6th International ICST Conference on Broadband Communications, Networks, and Systems}, publisher={IEEE}, proceedings_a={BROADNETS}, year={2009}, month={11}, keywords={Area measurement Environmental economics Informatics Load management Peer to peer computing Protocols Random media Sampling methods Statistical analysis Telecommunications}, doi={10.4108/ICST.BROADNETS2009.7239} }
- Zoltán Novák
Zoltán Pap
Year: 2009
Random Node Sampling in Kademlia
BROADNETS
IEEE
DOI: 10.4108/ICST.BROADNETS2009.7239
Abstract
We present a novel distributed method for selecting random nodes uniformly in Kademlia DHT networks. The algorithm does not require any extension to the Kademlia protocol and can be applied to any Kademlia-type network. It is easily tunable with one parameter to set an appropriate tradeoff between the evenness of the distribution and time – message – complexity. The method may be used as a building block for network algorithms in areas such as load balancing, Byzantine agreement, fault recovery and statistical measurements.
Copyright © 2009–2024 ICST