首页> 外文OA文献 >Design and performance analysis of fail-signal based consensus protocols for Byzantine faults
【2h】

Design and performance analysis of fail-signal based consensus protocols for Byzantine faults

机译:基于故障信号的拜占庭故障共识协议的设计和性能分析

摘要

Services offered by computing systems continue to play a crucial role in our every day lives. This thesis examines and solves a challenging problem in making these services dependable using means that can be assured not to compromise service responsiveness, particularly when no failure occurs. Causes of undependability are faults and faults of all known origins, including malicious attacks, are collectively referred to as Byzantine faults. Service or state machine replication is the only known technique for tolerating Byzantine faults. It becomes more effective when replicas are spaced out over a wide area network (WAN) such as the Internet - adding tolerance to localised disasters. It requires that replicas process the randomly arriving user requests in an identical order. Achieving this requirement together with deterministic termination guarantees is impossible in a fail-prone environment. This impossibility prevails because of the inability to accurately estimate a bound on inter-replica communication delays over a WAN. Canonical protocols in the literature are designed to delay termination until the WAN preserves convergence between actual delays and the estimate used. They thus risk performance degradation of the replicated service. We eliminate this risk by using Fail-Signal processesto circumvent the impossibility. A fail-signal (FS) process is made up of redundant, Byzantine-prone processes that continually check each other's performance. Consequently, it fails only by crashing and also signals its imminent failure. Using FS process constructs, a family of three order protocols has been developed: Protocol-0, Protocol-I and Protocol-11. Each protocol caters for a particular set of assumptions made in the FS process construction and the subsequent FS process behaviour. Protocol-I is extensively compared with a canonical protocol of Castro and Liskov which is widely acknowledged for its desirable performance. The study comprehensively establishes the cost and benefits of our approach in a variety of both real and emulated network settings, by varying number of replicas, system load and cryptographic techniques. The study shows that Protocol-I has superior performancp when no failures occur.
机译:计算系统提供的服务继续在我们的日常生活中发挥至关重要的作用。本文研究并解决了一个具有挑战性的问题,即使用可以确保不损害服务响应能力的方法来使这些服务可靠,尤其是在没有故障发生时。不可靠性的原因是故障,所有已知来源的故障(包括恶意攻击)统称为拜占庭故障。服务或状态机复制是忍受拜占庭式错误的唯一已知技术。当副本通过诸如Internet之类的广域网(WAN)间隔开时,它会变得更加有效-增强了对本地灾难的容忍度。它要求副本以相同的顺序处理随机到达的用户请求。在容易发生故障的环境中,无法实现此要求以及确定性的终止保证。由于无法准确估计WAN上副本间通信延迟的范围,因此这种可能性盛行。文献中的规范协议被设计为延迟终止,直到WAN保持实际延迟与所用估计之间的收敛为止。因此,它们冒着复制服务的性能下降的风险。我们通过使用“失败信号”流程来规避这种可能性,从而消除了这种风险。故障信号(FS)流程由易受拜占庭式影响的冗余流程组成,该流程不断检查彼此的性能。因此,它仅通过崩溃而失败,并且还表示即将发生故障。使用FS过程构造,已经开发了三个顺序协议的族:协议0,协议I和协议11。每个协议都满足FS流程构造和后续FS流程行为中做出的一组特定假设。协议I与Castro和Liskov的规范协议进行了广泛的比较,后者因其理想的性能而广受认可。这项研究通过改变副本数量,系统负载和加密技术,在各种实际和模拟网络设置中全面确定了我们方法的成本和收益。研究表明,当没有故障发生时,Protocol-I具有卓越的性能。

著录项

  • 作者

    Tariq Qurat-ul-Ain Inayat;

  • 作者单位
  • 年度 2007
  • 总页数
  • 原文格式 PDF
  • 正文语种 English
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号