首页> 外文期刊>Journal of Parallel and Distributed Computing >On achieving interactive consistency in real-world distributed systems
【24h】

On achieving interactive consistency in real-world distributed systems

机译:实现现实世界分布式系统中的互动一致性

获取原文
获取原文并翻译 | 示例

摘要

Interactive consistency is the problem in which n distinct nodes, each having its own private value, where up to t may be Byzantine, run an algorithm that allows all non-faulty nodes to infer the values of each other node. This problem is relevant to critical applications that rely on the combination of the opinions of multiple peers to provide a service. Examples include monitoring a content source to prevent equivocation or to track variability in the content provided, and resolving divergent state amongst the nodes of a distributed system. Previous works assume a fully synchronous system, where one can make strong assumptions such as negligible message delivery delays and/or detection of absent messages. However, practical, real-world systems are mostly asynchronous, i.e., they exhibit only some periods of synchrony during which message delivery is timely, thus requiring a different approach. In this paper, we present a thorough study of practical interactive consistency. We leverage the vast prior work on broadcast and Byzantine consensus algorithms to design, implement and evaluate a set of randomized algorithms, with only a single synchronization barrier and varying message complexities, that can be used to achieve interactive consistency in real-world distributed systems. We present formal proofs of correctness and message complexity of our proposed algorithms. We provide a complete, open-source implementation of each proposed interactive consistency algorithm by building a multi-layered software stack of algorithms that includes several broadcast algorithms, as well as a binary and a multi-valued consensus algorithm. Most of these algorithms have never been implemented and evaluated in a real system before. Finally, we analyze the performance of our suite of algorithms experimentally by testing both single instance and multiple parallel instances of each alternative and present a case study of achieving interactive consistency in a real-world distributed e-voting system.
机译:交互式一致性是一个问题,其中n个不同的节点,每个节点都具有自己的私有值,最多可以是拜占庭的,运行允许所有非故障节点的算法推断彼此节点的值。此问题与依赖于多个对等体的意见组合提供服务的关键应用程序相关。示例包括监视内容源以防止在分布式系统的节点中提供所提供的内容中的成功或跟踪可变性,并在分布式系统的节点中解析发散状态。以前的作品假设一个完全同步系统,其中一个人可以做出强烈的假设,例如可忽略的消息传递延迟和/或检测不存在消息。然而,实用的现实系统大多是异步的,即,它们只展示了一些同步时期,在此期间邮件交付是及时的,因此需要不同的方法。在本文中,我们对实际交互式一致性进行了彻底的研究。我们利用广播和拜占庭共识算法的广泛工作,实现和评估一组随机算法,只有单一同步障碍和不同的消息复杂性,可用于实现现实世界分布式系统中的交互式一致性。我们呈现了我们所提出的算法的正式正确性和信息复杂性。我们通过构建包括多个广播算法的多层软件堆栈以及二进制和多价共识算法来提供每个提出的交互式一致性算法的完整开源实现。这些算法中的大多数从未在真实系统中实现和评估。最后,我们通过测试每种替代方案的单一实例和多个并行实例来分析我们的算法套件的性能,并在现实世界分布式电子投票系统中实现互动一致性的案例研究。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号