Self-stabilizing and byzantine-tolerant overlay network

Danny Dolev*, Ezra N. Hoch, Robbert Van Renesse

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

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,

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 11th International Conference, OPODIS 2007, Proceedings
PublisherSpringer Verlag
Pages343-357
Number of pages15
ISBN (Print)9783540770954
DOIs
StatePublished - 2007
Event11th International Conference on Principles of Distributed Systems, OPODIS 2007 - Guadeloupe, France
Duration: 17 Dec 200720 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4878 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Principles of Distributed Systems, OPODIS 2007
Country/TerritoryFrance
CityGuadeloupe
Period17/12/0720/12/07

Fingerprint

Dive into the research topics of 'Self-stabilizing and byzantine-tolerant overlay network'. Together they form a unique fingerprint.

Cite this