Fast consensus under eventually stabilizing message adversaries

Manfred Schwarz, Kyrill Winkler, U. Schmid
{"title":"Fast consensus under eventually stabilizing message adversaries","authors":"Manfred Schwarz, Kyrill Winkler, U. Schmid","doi":"10.1145/2833312.2833323","DOIUrl":null,"url":null,"abstract":"This paper1 is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting periods of massive transient faults, we consider message adversaries that guarantee periods of less erratic message loss only eventually: We present a tight bound of 2D + 1 for the termination time of consensus under a message adversary that eventually guarantees a single vertex-stable root component with dynamic network diameter D, as well as a simple algorithm that matches this bound. It effectively halves the termination time 4D + 1 achieved by the fastest consensus algorithm known so far. We also introduce a generalized, considerably stronger variant of our message adversary, and show that our new algorithm, unlike the existing one, still works correctly under it.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 17th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2833312.2833323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

This paper1 is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting periods of massive transient faults, we consider message adversaries that guarantee periods of less erratic message loss only eventually: We present a tight bound of 2D + 1 for the termination time of consensus under a message adversary that eventually guarantees a single vertex-stable root component with dynamic network diameter D, as well as a simple algorithm that matches this bound. It effectively halves the termination time 4D + 1 achieved by the fastest consensus algorithm known so far. We also introduce a generalized, considerably stronger variant of our message adversary, and show that our new algorithm, unlike the existing one, still works correctly under it.
最终稳定消息对手下的快速共识
本文研究了受全知消息对手控制的单向同步动态网络中的确定性共识问题。由于不可预测的节点/系统初始化时间和长时间的大规模瞬态故障,我们考虑了保证最终较少不稳定消息损失的消息对手:我们提出了在消息对手最终保证具有动态网络直径D的单个顶点稳定根组件的共识终止时间的2D + 1的紧界,以及匹配该界的简单算法。它有效地将目前已知最快的共识算法的终止时间4D + 1减半。我们还介绍了我们的消息对手的一个广义的、相当强大的变体,并表明我们的新算法与现有算法不同,在它下仍然可以正确工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信