分布式协议和异构信任：技术报告
Distributed Protocols and Heterogeneous Trust: Technical Report
摘要：
分布式系统的鲁棒性通常用它们可以承受的某些类型的故障的数量来描述。然而，这些失败模型过于粗糙，无法描述现代世界中参与者的不同类型的信任和期望，复杂的集成系统跨越不同的所有者，网络和管理域。现代系统通常存在于异构信任的环境中，其中不同的参与者可能对其他节点的可信度有不同的意见，并且单个参与者可能认为其他节点在其可信度方面不同。我们探讨如何构建分布式协议，满足所有参与者的要求，即使在异构的信任环境。我们的方法的关键是使用基于格的信息流来分析和证明协议的属性。为了证明这种方法，我们展示了两个早期的分布式算法可以推广到异构信任的存在下工作：第一，异构快速共识，早期Bosco快速共识协议的适应;和第二，Nysiad，一个算法转换为崩溃容忍协议拜占庭容忍。通过模拟，我们表明，定制一个协议，异构的信任配置产生的性能改善了传统的协议设计的同质信任。
英文摘要：
The robustness of distributed systems is usually phrased in terms of the number of failures of certain types that they can withstand. However, these failure models are too crude to describe the different kinds of trust and expectations of participants in the modern world of complex, integrated systems extending across different owners, networks, and administrative domains. Modern systems often exist in an environment of heterogeneous trust, in which different participants may have different opinions about the trustworthiness of other nodes, and a single participant may consider other nodes to differ in their trustworthiness. We explore how to construct distributed protocols that meet the requirements of all participants, even in heterogeneous trust environments. The key to our approach is using lattice-based information flow to analyse and prove protocol properties. To demonstrate this approach, we show how two earlier distributed algorithms can be generalized to work in the presence of heterogeneous trust: first, Heterogeneous Fast Consensus, an adaptation of the earlier Bosco Fast Consensus protocol; and second, Nysiad, an algorithm for converting crash-tolerant protocols to be Byzantine-tolerant. Through simulations, we show that customizing a protocol to a heterogeneous trust configuration yields performance improvements over the conventional protocol designed for homogeneous trust.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
