Fault-Tolerant Consensus in Unknown and Anonymous Networks

C. Delporte-Gallet, H. Fauconnier, A. Tielmann
{"title":"Fault-Tolerant Consensus in Unknown and Anonymous Networks","authors":"C. Delporte-Gallet, H. Fauconnier, A. Tielmann","doi":"10.1109/ICDCS.2009.36","DOIUrl":null,"url":null,"abstract":"This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures.  We provide algorithms to emulate registers and solve consensus under different synchrony assumptions. For this, we introduce a novel pseudo leader-election approach which allows a leader-based consensus implementation without breaking symmetry.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 29th IEEE International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2009.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

Abstract

This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures.  We provide algorithms to emulate registers and solve consensus under different synchrony assumptions. For this, we introduce a novel pseudo leader-election approach which allows a leader-based consensus implementation without breaking symmetry.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
未知和匿名网络中的容错共识
本文研究了在存在崩溃故障的未知匿名消息传递网络中,在何种条件下可以可靠地共享信息和解决共识问题。我们提供了算法来模拟寄存器并在不同的同步假设下解决共识。为此,我们引入了一种新的伪领导者选举方法,该方法允许基于领导者的共识实现而不破坏对称性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks TBD: Trajectory-Based Data Forwarding for Light-Traffic Vehicular Networks PADD: Power Aware Domain Distribution Rethinking Multicast for Massive-Scale Platforms ISP Friend or Foe? Making P2P Live Streaming ISP-Aware
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1