Approximate Byzantine Consensus in Faulty Asynchronous Networks

被引:0
|
作者
Haseltalab, A. [1 ]
Akar, Mehmet [1 ]
机构
[1] Bogazici Univ, Dept Elect & Elect Engn, TR-34342 Istanbul, Turkey
关键词
MULTIAGENT SYSTEMS; AGREEMENT;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a novel fault-tolerant algorithm for achieving approximate Byzantine consensus in asynchronous networks is proposed. It is shown that the topological condition required for the success of the algorithm is more relaxed than the previous results. We prove that the synchronicity of the network does not affect this condition and the algorithm succeeds in synchronous networks as well. The same fact is concluded in networks with delay on communication paths. Finally, we extend the results to networks with time-varying underlying graph.
引用
收藏
页码:1591 / 1596
页数:6
相关论文
共 50 条
  • [21] Reaching approximate Byzantine consensus with multi-hop communication
    Su, Lili
    Vaidya, Nitin H.
    [J]. INFORMATION AND COMPUTATION, 2017, 255 : 352 - 368
  • [22] High-Performance Asynchronous Byzantine Fault Tolerance Consensus Protocol
    Knudsen, Henrik
    Li, Jingyue
    Notland, Jakob Svennevik
    Haro, Peter Halland
    Raeder, Truls Bakkejord
    [J]. 2021 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN (BLOCKCHAIN 2021), 2021, : 476 - 483
  • [23] Optimal Byzantine Resilient Convergence in Asynchronous Robots Networks
    Bouzid, Zohir
    Potop-Butucaiu, Maria Gradmaim
    Tixeml, Sebasten
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5873 : 165 - 179
  • [24] Density Classification in Asynchronous Random Networks with Faulty Nodes.
    Gogolev, Alexander
    Marcenaro, Lucio
    [J]. 2014 22ND EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, AND NETWORK-BASED PROCESSING (PDP 2014), 2014, : 256 - 261
  • [25] A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
    Fraigniaud, Pierre
    Paz, Ami
    Rajsbaum, Sergio
    [J]. PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 460 - 470
  • [26] Asynchronous approximate agreement in partially connected networks
    Azadmanesh, M.H.
    Kieckhafer, R.M.
    [J]. International Journal of Parallel and Distributed Systems and Networks, 2002, 5 (01): : 26 - 32
  • [27] Simple and efficient oracle-based Consensus protocols for asynchronous Byzantine systems
    Friedman, R
    Mostefaoui, A
    Raynal, M
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2005, 2 (01) : 46 - 56
  • [28] Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
    Friedman, R
    Mostefaoui, A
    Raynal, M
    [J]. 23RD IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, : 228 - 237
  • [29] Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
    Jimenez, Ernesto
    Luis Lopez-Presa, Jose
    Martin-Rueda, Javier
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 107 : 54 - 71
  • [30] Resilient Asymptotic Consensus in Asynchronous Robust Networks
    LeBlanc, Heath J.
    Koutsoukos, Xenofon
    [J]. 2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 1742 - 1749