.png){kind=icon}
返回
Dynamic Byzantine Broadcast in Asynchronous Message-Passing Systems
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3202627.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The reconfiguration problem is considered a key challenge in distributed systems, especially in dynamic asynchronous message-passing systems. To keep the data reliability and availability in long-lived systems, any pro;
cols should support reconfigurations,;
dynamically add resources, or remove old and slow machines with newer faster ones. Previous results in reconfigurations either rely on consensus, or study the problem restricted;
crash failures only. However, it is difficult;
argue that real-world systems experience crash failures only. In this paper, we study the dynamic reconfiguration problem in fully asynchronous message-passing systems with Byzantine faults. We first specify dynamic Byzantine broadcast, and then specify a clean and explicit liveness condition. We show that dynamic Byzantine broadcast is solvable by presenting a dynamic Byzantine consistent broadcast algorithm and a dynamic Byzantine reliable broadcast algorithm.
Keyword:
Pro
cols
Heuristic algorithms
Fault
lerant systems
Broadcasting
Computer crashes
Safety
Reliability engineering
Reconfigurable architectures
Byzantine network
dynamic system
broadcast
reconfiguration
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Factors associated with seizure-related motor vehicle accidents among patients with epilepsy in West China.png)
Seizure
OAAI
SeizureIF0
OAAI分享收藏
查看更多内容