Self-stabilizing and byzantine-tolerant overlay network

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against permanent Byzantine faults. The overlay structure has a logarithmic diameter with high probability, which matches the diameter of less robust overlays. The overlay can withstand high churn without affecting the ability of active and correct members to disseminate their messages. The construction uses a randomized technique to choose the neighbors of each member, while limiting the ability of Byzantine members to affect the randomization or to disturb the construction. The basic ideas generalize the original Fireflies construction that withstands Byzantine failures but was not self-stabilizing, © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Dolev, D., Hoch, E. N., & Van Renesse, R. (2007). Self-stabilizing and byzantine-tolerant overlay network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4878 LNCS, pp. 343–357). Springer Verlag. https://doi.org/10.1007/978-3-540-77096-1_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free