| |
|
2012/11/20, MC103, 12 - 12:30
A probabilistic analysis of Kademlia networks
Xing Shi
Cai
, Master's student, McGill
Abstract:
Nowadays Kademlia is one of the most widely used dhts (Distributed Hash
Table) in P2P (peer-to-peer) networks. This work studies one essential
question about Kademlia overlay networks from a mathematical
perspective: how long does it take to locate a node? To answer it, we
introduce a random graph K to model a Kademlia overlay and study how
long it takes to locate a given vertex in K by using Kademlia’s routing
algorithm.
|
|
|
