Secure peer sampling

DOI10.1016/J.COMNET.2010.03.020zbMATH Open1204.68033OpenAlexW2168974409WikidataQ61717266 ScholiaQ61717266MaRDI QIDQ991229FDOQ991229

Authors: Gian Paolo Jesi, Alberto Montresor, Maarten Van Steen 

Publication date: 2 September 2010

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2010.03.020

Recommendations

• Brahms: Byzantine resilient random membership sampling
• Brahms
• On gossip and populations
• scientific article; zbMATH DE number 2080512
• Tolerating malicious gossip

zbMATH Keywords

securityP2Pgossipoverlaypeer sampling

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited In (8)

• On gossip and populations
• Tolerating malicious gossip
• Computational Science – ICCS 2005
• AVCOL: availability-aware information aggregation in large distributed systems under uncollaborative behavior
• Agents and Peer-to-Peer Computing
• Brahms: Byzantine resilient random membership sampling
• TTLed random walks for collaborative monitoring in mobile and social networks
• Peer counting and sampling in overlay networks based on random walks

This page was built for publication: Secure peer sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991229)