ID distribution in KAD

Authors:
Fuhong Lin;Fudong Lin;Changjia Chen;Hengkui Wu;Hongke Zhang
Affiliations:
Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Year:
2010

Citing 5
Cited 0

Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Understanding churn in peer-to-peer networks

Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A global view of kad

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Long term study of peer behavior in the KAD DHT

IEEE/ACM Transactions on Networking (TON)
Avoiding eclipse attacks on kad/kademlia: an identity based approach

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Whether KAD IDs are uniformly distributed in the KAD network is a very important point, for it can influence the structure of the routing table. Further influence the routing peiformance. In this paper, two methodologies are used to verifY our assumption that KAD IDs do uniformly distributed. The first one is in XOR space. We made the distribution of the XORdistance; the second methodology we used is in Euclidean space. We made the distribution of the Euclidean-distance. The outcome is that KAD IDs follow exponential distribution. Lastly we got a suitable model to fit the actual situation.