最小化基于有向无环图的原子广播的提交规则
Minimizing Commit Rules for DAG-based Atomic Broadcast
浏览论文内容
中文总结 AI 辅助
本文针对基于DAG的原子广播协议，定义提交规则的子规则关系，确定最终同步与异步模型中的最小提交规则，提出新协议Minnow并实现为S-Minnow与A-Minnow。
中文摘要 AI 辅助
一类流行的拜占庭容错原子广播协议依赖于表示广播消息之间因果关系的有向无环图（DAG）。每个进程在其本地DAG上应用特定于协议的提交规则，以确定哪些顶点可以按总顺序交付。直观而言，对DAG施加更少条件以对其顶点排序的提交规则意味着协议更高效，因为广播消息的交付延迟更低。本文中，我们在未认证的基于轮次的DAG构造上定义提交规则，并引入它们之间的子规则关系：对于任意DAG，若提交规则cr₁提交的顶点集合包含cr₂提交的所有顶点，则cr₁是cr₂的子规则。我们利用子规则关系确定最终同步模型中的最小提交规则和异步模型中的最小提交规则，即两个在各自模型中对DAG施加最少条件即可安全提交任意顶点集合的提交规则。据我们所知，现有基于DAG的原子广播协议均未采用此类最小提交规则；我们提出了Minnow，一种新的基于DAG的原子广播协议，可在最终同步网络（S-Minnow）和异步网络（A-Minnow）中实例化。
英文摘要
A popular class of Byzantine fault-tolerant atomic broadcast protocols rely on directed acyclic graphs (DAGs) that represent causal relations between broadcast messages. Each process applies a protocol-specific \emph{commit rule} on its local DAG to determine which vertices can be delivered in a total order. Intuitively, commit rules that impose fewer conditions on the DAG to order its vertices imply more efficient protocols, as the broadcast messages are delivered with lower latency. In this paper, we define commit rules on an uncertified round-based DAG construction, and introduce a sub-rule relation between them: a commit rule $cr_1$ is a sub-rule of a commit rule $cr_2$ if, for any DAG, the set of vertices committed by $cr_1$ contains all vertices committed by $cr_2$. We use the sub-rule relation to determine a minimal commit rule in an eventually synchronous model and a minimal commit rule in an asynchronous model, namely, two commit rules that require the least conditions on the DAG to safely commit any set of vertices in their respective models. To the best of our knowledge, no existing DAG-based atomic broadcast protocol relies on such minimal commit rules: we introduce \emph{Minnow}, a new protocol for DAG-based atomic broadcast, which can be instantiated in both eventually synchronous (S-Minnow) and asynchronous networks (A-Minnow).
