Traditional resilient systems operate on fully-replicated fault-tolerant clusters, which limits their scalability and performance. One way to make the step towards resilient high-performance systems that can deal with huge workloads, is by enabling independent fault-tolerant clusters to efficiently communicate and cooperate with each other, as this also enables the usage of high-performance techniques such as sharding and parallel processing. Recently, such inter-cluster communication was formalized as the Byzantine cluster-sending problem, and worst-case optimal protocols have been proposed that solve this problem. Unfortunately, these protocols have an all-case linear complexity in the size of the clusters involved. In this paper, we propose probabilistic cluster-sending techniques that can reliably send messages from one Byzantine fault-tolerant cluster to another with only an expected constant message complexity, this independent of the size of the clusters involved. Depending on the robustness of the clusters involved, our techniques require only two-to-four message round-trips. Furthermore, our protocols can support worst-case linear communication between clusters, which is optimal, and deal with asynchronous and unreliable communication. As such, our work provides a strong foundation for the further development of resilient high-performance systems.

中文翻译：

---

拜占庭集群发送在预期的持续通信中

传统的弹性系统在完全复制的容错集群上运行，这限制了它们的可扩展性和性能。迈向可以处理大量工作负载的弹性高性能系统的一种方法是使独立的容错集群能够有效地相互通信和合作，因为这也可以使用高性能技术，例如分片和并行处理。最近，这种集群间通信被形式化为拜占庭集群发送问题，并且已经提出了解决这个问题的最坏情况最优协议。不幸的是，这些协议在所涉及的集群大小方面具有所有情况的线性复杂性。在这篇论文中，我们提出了概率集群发送技术，该技术可以可靠地将消息从一个拜占庭容错集群发送到另一个，并且只有预期的恒定消息复杂度，这与所涉及集群的大小无关。根据所涉及集群的健壮性，我们的技术只需要两到四次消息往返。此外，我们的协议可以支持集群之间最坏情况的线性通信，这是最佳的，并处理异步和不可靠的通信。因此，我们的工作为弹性高性能系统的进一步开发提供了坚实的基础。我们的技术只需要两到四次消息往返。此外，我们的协议可以支持集群之间最坏情况的线性通信，这是最佳的，并处理异步和不可靠的通信。因此，我们的工作为弹性高性能系统的进一步开发提供了坚实的基础。我们的技术只需要两到四次消息往返。此外，我们的协议可以支持集群之间最坏情况的线性通信，这是最佳的，并处理异步和不可靠的通信。因此，我们的工作为弹性高性能系统的进一步开发提供了坚实的基础。