Peer counting and sampling in overlay networks based on random walks

DOI10.1007/s00446-007-0027-zzbMath1266.68213OpenAlexW2137951248MaRDI QIDQ1954250

Laurent Massoulié, E. Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0027-z

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items

A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Fast Low-Cost Estimation of Network Properties Using Random Walks ⋮ A distributed counting architecture for exploring the structure of anonymous active-passive networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating network size from local information
• Routing networks for distributed hash tables
• Statistical mechanics of complex networks
• Viceroy
• Computing separable functions via gossip
• Peer counting and sampling in overlay networks