首页    期刊浏览 2024年11月26日 星期二
登录注册

文章基本信息

  • 标题:Byzantine-Tolerant Set-Constrained Delivery Broadcast
  • 本地全文:下载
  • 作者:Alex Auvolat ; Michel Raynal ; Fran{\c{c}}ois Ta{\"{i}}ani
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2020
  • 卷号:153
  • 页码:1-23
  • DOI:10.4230/LIPIcs.OPODIS.2019.6
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Set-Constrained Delivery Broadcast (SCD-broadcast), recently introduced at ICDCN 2018, is a high-level communication abstraction that captures ordering properties not between individual messages but between sets of messages. More precisely, it allows processes to broadcast messages and deliver sets of messages, under the constraint that if a process delivers a set containing a message m before a set containing a message m', then no other process delivers first a set containing m' and later a set containing m. It has been shown that SCD-broadcast and read/write registers are computationally equivalent, and an algorithm implementing SCD-broadcast is known in the context of asynchronous message passing systems prone to crash failures. This paper introduces a Byzantine-tolerant SCD-broadcast algorithm, which we call BSCD-broadcast. Our proposed algorithm assumes an underlying basic Byzantine-tolerant reliable broadcast abstraction. We first introduce an intermediary communication primitive, Byzantine FIFO broadcast (BFIFO-broadcast), which we then use as a primitive in our final BSCD-broadcast algorithm. Unlike the original SCD-broadcast algorithm that is tolerant to up to t
  • 关键词:Algorithm; Asynchronous system; Byzantine process; Communication abstraction; Distributed computing; Distributed software engineering; Fault-tolerance; Message-passing; Modularity; Read/write snapshot object; Reliable broadcast; Set-constrained message delivery
国家哲学社会科学文献中心版权所有