Peer counting and sampling in overlay networks

DOI10.1145/1146381.1146402zbMath1314.68030OpenAlexW2159741581MaRDI QIDQ5177273

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

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146402

zbMATH Keywords

samplingrandom walksexpander graphspeer-to-peer systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items

Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation ⋮ A variation of the Newton-Pepys problem and its connections to size-estimation problems ⋮ Distributed computation of exact average degree and network size in finite time under quantized communication ⋮ On the uniformity of peer sampling based on view shuffling ⋮ Peer counting and sampling in overlay networks based on random walks ⋮ Sampling online social networks by random walk with indirect jumps ⋮ Fast Low-Cost Estimation of Network Properties Using Random Walks ⋮ Estimating the size of a hidden finite set: large-sample behavior of estimators ⋮ On Gossip and Populations

This page was built for publication: Peer counting and sampling in overlay networks