Self-stabilizing and Byzantine-tolerant overlay network

被引:0
|
作者
Dolev, Danny [1 ]
Hoch, Ezra N. [1 ]
van Renesse, Robbert [2 ]
机构
[1] Hebrew Univ Jerusalem, Sch Engn & Comp Sci, IL-91905 Jerusalem, Israel
[2] Cornell Univ, Dept Comp Sci, Ithaca, NY USA
基金
美国国家科学基金会;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:343 / +
页数:3
相关论文
共 50 条
  • [41] Brief Announcement: A Framework for Building Self-Stabilizing Overlay Networks
    Berns, Andrew
    Ghosh, Sukumar
    Pemmaraju, Sriram V.
    PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 398 - 399
  • [42] Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery
    Dolev, Shlomi
    Liba, Omri
    Schiller, Elad M.
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013, 2013, 8255 : 351 - 353
  • [43] Self-stabilizing deterministic network decomposition
    Belkouch, F
    Bui, M
    Chen, LM
    Datta, AK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (04) : 696 - 714
  • [44] FORGIVE & FORGET Self-Stabilizing Swarms in Spite of Byzantine Robots
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Ooshita, Fukuhito
    Wada, Koichi
    2019 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2019), 2019, : 188 - 194
  • [45] Byzantine self-stabilizing pulse in a bounded-delay model
    Dolev, Danny
    Hoch, Ezra N.
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, 4838 : 234 - +
  • [46] Building self-stabilizing overlay networks with the transitive closure framework
    Berns, Andrew
    Ghosh, Sukumar
    Pemmaraju, Sriram V.
    THEORETICAL COMPUTER SCIENCE, 2013, 512 : 2 - 14
  • [47] Forgive and forget: Self-stabilizing swarms in spite of Byzantine robots
    Ashkenazi, Yotam
    Dolev, Shlomi
    Kamei, Sayaka
    Ooshita, Fukuhito
    Wada, Koichi
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (11):
  • [48] Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
    Duvignau, Romaric
    Raynal, Michel
    Schiller, Elad Michael
    THEORETICAL COMPUTER SCIENCE, 2025, 1039
  • [49] Byzantine-Tolerant Methods for Distributed Variational Inequalities
    Tupitsa, Nazarii
    Almansoori, Abdulla Jasem
    Wu, Yanlin
    Takac, Martin
    Nandakumar, Karthik
    Horvath, Samuel
    Gorbunov, Eduard
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [50] Self-stabilizing gathering of mobile robots under crash or Byzantine faults
    Defago, Xavier
    Potop-Butucaru, Maria
    Raipin-Parvedy, Philippe
    DISTRIBUTED COMPUTING, 2020, 33 (05) : 393 - 421