The Community for Technology Leaders
2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009 (2009)
Madrid
Sept. 14, 2009 to Sept. 16, 2009
ISSN: 2150-4903
ISBN: 978-963-9799-49-3
pp: 1-7
Zoltan Novak , Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, H-1117, Magyar tudósok körútja 2, HUNGARY
Zoltan Pap , Ericsson Telecomm. Hungary, H-1117, Irinyi J. u. 4-20, Budapest, HUNGARY
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.
INDEX TERMS
peer-to-peer computing, protocols, sampling methods
CITATION

Z. Novak and Z. Pap, "Random node sampling in Kademlia," 2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009(BROADNETS), Madrid, 2009, pp. 1-7.
doi:10.4108/ICST.BROADNETS2009.7239
96 ms
(Ver 3.3 (11022016))