Estimating network size from local information

DOI10.1016/J.IPL.2003.08.011zbMath1178.68681OpenAlexW2067330023MaRDI QIDQ1029023

Dahlia Malkhi, Keren Horowitz

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.08.011

zbMATH Keywords

algorithmsdistributed systemsdistributed computingapproximation algorithmspeer-to-peer systems

Mathematics Subject Classification ID

Distributed systems (68M14) Approximation algorithms (68W25)

Related Items (3)

Distributed probabilistic inferencing in sensor networks using variational approximation ⋮ Randomized leader election ⋮ Peer counting and sampling in overlay networks based on random walks

Uses Software

• Chord

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accessing nearby copies of replicated objects in a distributed environment
• Probabilistic quorums for dynamic systems
• D2B: A de Bruijn based content-addressable network
• The small-world phenomenon
• Novel architectures for P2P applications
• Viceroy

This page was built for publication: Estimating network size from local information