论文标题
异步拜占庭式网络中的共识
Asynchronous Byzantine Approximate Consensus in Directed Networks
论文作者
论文摘要
在这项工作中，我们研究了异步消息通讯网络中某些节点可能成为拜占庭错误的近似共识问题。我们回答了Tseng和Vaidya（2012年）提出的一个开放问题，该问题提出了针对有名网络的最佳弹性算法。有趣的是，我们的结果表明，异步拜占庭的基础通信网络的紧密条件与同步拜占庭精确共识的紧密条件相吻合。我们的结果可以看作是Abraham等人，2004年对算法的非平凡概括，该算法适用于完整网络的特殊情况。在纸张中确定的紧密条件和技术揭示了解决异步定向网络中近似共识的基本特性。
In this work, we study the approximate consensus problem in asynchronous message-passing networks where some nodes may become Byzantine faulty. We answer an open problem raised by Tseng and Vaidya, 2012, proposing the first algorithm of optimal resilience for directed networks. Interestingly, our results show that the tight condition on the underlying communication networks for asynchronous Byzantine approximate consensus coincides with the tight condition for synchronous Byzantine exact consensus. Our results can be viewed as a non-trivial generalization of the algorithm by Abraham et al., 2004, which applies to the special case of complete networks. The tight condition and techniques identified in the paper shed light on the fundamental properties for solving approximate consensus in asynchronous directed networks.
