Consensus in the presence of mortal Byzantine faulty processes

被引：2

作者：

Widder, Josef ^{[1
]}

Biely, Martin ^{[2
]}

Gridling, Guenther ^{[3
]}

Weiss, Bettina ^{[3
]}

Blanquart, Jean-Paul ^{[4
]}

机构：

[1] Vienna Univ Technol, Formal Methods Syst Engn Grp E184 4, A-1060 Vienna, Austria

[2] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland

[3] Vienna Univ Technol, Embedded Comp Syst Grp E182 2, A-1060 Vienna, Austria

[4] Astrium Satellites, Toulouse, France

来源：

DISTRIBUTED COMPUTING | 2012年 / 24卷 / 06期

基金：

奥地利科学基金会; 美国国家科学基金会;

关键词：

Consensus; Byzantine fault; Distributed algorithm; Fault tolerance; Complexity; FAILURE DETECTORS; UNIFORM CONSENSUS; AGREEMENT; CRASH; BROADCAST; PROTOCOLS;

D O I：

10.1007/s00446-011-0147-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model "mortal Byzantine". After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.

引用

页码：299 / 321

页数：23

共 50 条

[1] Consensus in the presence of mortal Byzantine faulty processes
Josef Widder
Martin Biely
Günther Gridling
Bettina Weiss
Jean-Paul Blanquart
[J]. Distributed Computing, 2012, 24 : 299 - 321
[2] Approximate Byzantine Consensus in Faulty Asynchronous Networks
Haseltalab, A.
Akar, Mehmet
[J]. 2015 AMERICAN CONTROL CONFERENCE (ACC), 2015, : 1591 - 1596
[3] Strong Dynamic Consensus in Byzantine Faulty Systems with Churn
Klappenecker, Andreas
Lee, Hyunyoung
[J]. 2013 19TH IEEE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2013), 2013, : 323 - 330
[4] Reaching Consensus with Byzantine Faulty Controllers in Software-Defined Networks
Cheng, Chien-Fu
Lin, Jerry Chun-Wei
Srivastava, Gautam
Hsu, Chu-Chiao
[J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021
[5] Distributed Faulty Node Detection in DTNs in Presence of Byzantine Attack
Li, Wenjie
Bassi, Francesca
Kieffer, Michel
Calisti, Alex
Pasolini, Gianni
Dardari, Davide
[J]. 2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
[6] Resilient group consensus in the presence of Byzantine agents
Oksuz, Halil Yigit
Akar, Mehmet
[J]. INTERNATIONAL JOURNAL OF CONTROL, 2021, 94 (03) : 807 - 822
[7] Causal Ordering in the Presence of Byzantine Processes
Misra, Anshuman
Kshemkalyani, Ajay D.
[J]. 2022 IEEE 28TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, ICPADS, 2022, : 130 - 138
[8] Quick Consensus Through Early Disposal of Faulty Processes
Dalui, Mamata
Chakraborty, Bidesh
Sikdar, Biplab K.
[J]. 2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 1989 - 1994
[9] IMPOSSIBILITY RESULTS IN THE PRESENCE OF MULTIPLE FAULTY PROCESSES
TAUBENFELD, G
KATZ, S
MORAN, S
[J]. INFORMATION AND COMPUTATION, 1994, 113 (02) : 173 - 198
[10] IMPOSSIBILITY RESULTS IN THE PRESENCE OF MULTIPLE FAULTY PROCESSES
TAUBENFELD, G
KATZ, S
MORAN, S
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 405 : 109 - 120

← 1 2 3 4 5 →