Random walks in peer-to-peer networks: A
β
Christos Gkantsidis; Milena Mihail; Amin Saberi
π
Article
π
2006
π
Elsevier Science
π
English
β 243 KB
We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achieves better results than flooding: (a) when the overlay topology is clustered, and (b) when a client