𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Peer counting and sampling in overlay networks based on random walks

✍ Scribed by A. J. Ganesh; A. -M. Kermarrec; E. Le Merrer; L. Massoulié

Book ID
106146279
Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
430 KB
Volume
20
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks in peer-to-peer networks: A
Random walks in peer-to-peer networks: Algorithms and evaluation
✍ 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