发表机构
Friedrich-Alexander-Universität Erlangen-Nürnberg（埃尔朗根-纽伦堡弗里德里希·亚历山大大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文通过扩展BFT-SMaRt引入模块化法定人数系统抽象，在同一框架内比较多种法定人数构造，利用网络模拟探索其对广域网BFT复制中客户端延迟的影响。
AI 中文摘要
法定人数系统在拜占庭容错（BFT）状态机复制中强制执行严格的一致性：在决定一个值之前，一个副本子集（称为法定人数）必须为该值交换投票。在广域网中，法定人数的大小和组成决定了副本能够取得进展的速度，从而影响客户端感知的延迟。已有多种法定人数构造被提出，例如阈值、加权、网格等，但文献中缺乏同类比较。每种构造通常存在于不同的协议实现中，因此法定人数设计对客户端延迟的影响难以与其他实现效果（尤其是优化技术的使用）分离开来。在本文中，我们通过扩展BFT-SMaRt，引入一个模块化的法定人数系统抽象，使各种法定人数构造能够存在于同一框架内并与同一组优化技术交互，从而弥补了这一差距。通过我们的框架，我们利用网络模拟探索了不同法定人数系统构造对广域网BFT复制中客户端观察到的延迟的影响。
英文摘要
Quorum systems enforce strict consistency in Byzantine fault-tolerant (BFT) state machine replication: Before a value is decided, a subset of replicas (called quorum) must exchange votes for the value. In wide-area networks, the size and composition of a quorum determines the speed at which replicas can make progress and thus impacts the latency perceived by clients. A variety of quorum constructions has been proposed, e.g., threshold, weighted, grid and others, but the literature offers little in the way of an apples-to-apples comparison. Each construction typically lives inside a different protocol implementation, so the influence of quorum design on client latency cannot be easily separated from other implementation effects, especially the use of optimization techniques. In this paper, we close that gap by extending BFT-SMaRt with a modular quorum-system abstraction that allows a variety of quorum constructions to live inside the same framework and interact with the same set of optimization techniques. Via our framework, we explore the impact of different quorum system constructions on client-observed latency in wide-area BFT replication using network simulation.
CommentsAccepted at LADC 2026, the 15th Latin-American Symposium on Dependable and Secure Computing. 15 Pages
