Peer counting and sampling in overlay networks based on random walks
From MaRDI portal
Publication:1954250
DOI10.1007/s00446-007-0027-zzbMath1266.68213MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W15: Distributed algorithms
05C81: Random walks on graphs
Related Items
Fast Low-Cost Estimation of Network Properties Using Random Walks, A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, A distributed counting architecture for exploring the structure of anonymous active-passive networks
Cites Work