论文标题
实用网络中可靠的广播：算法和评估
Reliable Broadcast in Practical Networks: Algorithm and Evaluation
论文作者
论文摘要
可靠的广播是一个重要的原始性，可确保源节点可以在异步和容易产生失败的网络系统中可靠地向所有非故障节点传播消息。 Bracha于1987年首次提出了拜占庭可靠的广播协议，并已广泛用于耐断层的系统和协议中。最近的一些协议改善了这些算法的循环和钻头复杂性。在实际网络中的限制中，我们重新审视了问题。特别是，我们使用加密哈希功能和擦除编码来降低通信和计算复杂性并简化协议设计。我们还确定了拜占庭可靠广播方案的基本权衡，这些方案（节点数），局部计算，圆形复杂性和位复杂性。最后，我们还为类似的通信协议设计并实施了一个通用测试框架。我们使用框架评估我们的协议。结果表明，我们的协议在实际网络中具有较高的性能。
Reliable broadcast is an important primitive to ensure that a source node can reliably disseminate a message to all the non-faulty nodes in an asynchronous and failure-prone networked system. Byzantine Reliable Broadcast protocols were first proposed by Bracha in 1987, and have been widely used in fault-tolerant systems and protocols. Several recent protocols have improved the round and bit complexity of these algorithms. Motivated by the constraints in practical networks, we revisit the problem. In particular, we use cryptographic hash functions and erasure coding to reduce communication and computation complexity and simplify the protocol design. We also identify the fundamental trade-offs of Byzantine Reliable Broadcast protocols with respect to resilience (number of nodes), local computation, round complexity, and bit complexity. Finally, we also design and implement a general testing framework for similar communication protocols. We evaluate our protocols using our framework. The results demonstrate that our protocols have superior performance in practical networks.
