arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.09123cs.DC
收藏

让每个字都有意义:使用更少单词的自适应 BA

Make Every Word Count: Adaptive BA with Fewer Words

Shir Cohen, Idit Keidar, Alexander Spiegelman

AI总结:

本文针对实际常见故障较少的运行场景,提出了首个通信复杂度为 $O(n(f+1))$ 的 Byzantine Broadcast 算法,以及具有强一致性的 BA 最优弹性算法,在无故障时实现线性通信复杂度。

摘要:

拜占庭协议是许多分布式系统的关键组件。虽然 Dolev 和 Reischuk 早就证明了二次通信复杂度在最坏情况下是必要的,但在故障更少的实际常见运行中能做什么的问题仍然悬而未决。本文提出了首个通信复杂度为 $O(n(f+1))$ 的 Byzantine Broadcast 算法,其中 $0\leq f\leq t$ 是单次运行中进程故障的实际数量。对于具有强一致性的 BA,我们提出了首个最优弹性算法,它在无故障情况下具有线性通信复杂度,否则为二次开销。

英文摘要:

Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\leq f\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑