Measuring robustness of superpeer topologies

DOI10.1145/1281100.1281179MaRDI QIDQ5401470zbMATH OpenOpenAlexFDO

Authors Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy Ganguly

Publication date 13 March 2014

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

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

zbMATH Keywords

stabilitypercolation theorysuperpeer networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Robustness measurement for consensus systems with multi-graph communication
• The Design and Evaluation of a Self-Organizing Superpeer Network
• Measuring the robustness of a network using minimal vertex covers
• Quantifying network topology robustness under budget constraints: general model and computational complexity
• Robustness and strong attack tolerance of low-diameter networks
• Performance evaluation of independent superbasic sets on nonlinear replicated networks
• Asymptotic Network Robustness

Cited in

(1)

• Evaluation mechanism for preventing free-ider in super-node overlay

This page was built for publication: Measuring robustness of superpeer topologies

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