拜占庭将军问题的新解

Q4 Mathematics
Rüdiger Reischuk
{"title":"拜占庭将军问题的新解","authors":"Rüdiger Reischuk","doi":"10.1016/S0019-9958(85)80042-5","DOIUrl":null,"url":null,"abstract":"<div><p>We define a new model for algorithms to reach Byzantine Agreement. It allows one to measure the complexity more accurately, to differentiate between processor faults, and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2<em>f</em> + 3 in the worst case, where <em>f</em> is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Its average performance can also easily be analysed making realistic assumptions on random distribution of faults. We show that it stops with high probability after a small number of phases.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Pages 23-42"},"PeriodicalIF":0.0000,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80042-5","citationCount":"78","resultStr":"{\"title\":\"A new solution for the Byzantine generals problem\",\"authors\":\"Rüdiger Reischuk\",\"doi\":\"10.1016/S0019-9958(85)80042-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We define a new model for algorithms to reach Byzantine Agreement. It allows one to measure the complexity more accurately, to differentiate between processor faults, and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2<em>f</em> + 3 in the worst case, where <em>f</em> is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Its average performance can also easily be analysed making realistic assumptions on random distribution of faults. We show that it stops with high probability after a small number of phases.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"64 1\",\"pages\":\"Pages 23-42\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80042-5\",\"citationCount\":\"78\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 78

摘要

我们定义了一个新的算法模型来达到拜占庭协议。它允许人们更准确地测量复杂性,区分处理器故障,并包括通信链路故障。提出了一种确定性算法,在最坏情况下,在2f + 3阶段提前停止,其中f为实际故障数,在较低的条件下,比以前的算法更严格。在假设故障随机分布的情况下,也可以很容易地分析其平均性能。我们证明了它在少量相位后以高概率停止。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new solution for the Byzantine generals problem

We define a new model for algorithms to reach Byzantine Agreement. It allows one to measure the complexity more accurately, to differentiate between processor faults, and to include communication link failures. A deterministic algorithm is presented that exhibits early stopping by phase 2f + 3 in the worst case, where f is the actual number of faults, under less stringent conditions than the ones of previous algorithms. Its average performance can also easily be analysed making realistic assumptions on random distribution of faults. We show that it stops with high probability after a small number of phases.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信