Expected linear round synchronization: the missing link for linear Byzantine SMR

IF 1.3 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Distributed Computing Pub Date : 2024-01-08 DOI:10.1007/s00446-023-00459-9

Oded Naor, Idit Keidar

引用次数: 0

Abstract

State Machine Replication (SMR) solutions often divide time into rounds, with a designated leader driving decisions in each round. Progress is guaranteed once all correct processes synchronize to the same round, and the leader of that round is correct. Recently suggested Byzantine SMR solutions such as HotStuff, and LibraBFT achieve progress with a linear message complexity and a constant time complexity once such round synchronization occurs. But round synchronization itself incurs an additional cost. By Dolev and Reischuk’s lower bound, any deterministic solution must have \(\Omega (n^2)\) communication complexity. Yet the question of randomized round synchronization with an expected linear message complexity remained open. We present an algorithm that, for the first time, achieves round synchronization with expected linear message complexity and expected constant latency. Existing protocols can use our round synchronization algorithm to solve Byzantine SMR with the same asymptotic performance.

Abstract Image

查看原文本刊更多论文

预期线性轮同步：线性拜占庭 SMR 缺失的环节

状态机复制（SMR）解决方案通常将时间划分为若干轮，每轮由指定的领导者驱动决策。一旦所有正确的进程都同步到同一轮，并且该轮的领导者是正确的，就能保证取得进展。最近提出的拜占庭 SMR 解决方案（如 HotStuff 和 LibraBFT）在实现这种回合同步后，能以线性信息复杂度和恒定时间复杂度取得进展。但是，轮同步本身会产生额外的成本。根据 Dolev 和 Reischuk 的下界，任何确定性解决方案都必须具有 \(\Omega (n^2)\) 通信复杂度。然而，具有预期线性信息复杂度的随机轮同步问题仍然悬而未决。我们提出了一种算法，首次实现了预期线性消息复杂度和预期恒定延迟的轮同步。现有的协议可以使用我们的回合同步算法来解决拜占庭 SMR，并具有相同的渐进性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Distributed Computing 工程技术-计算机：理论方法

CiteScore

3.20

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.