Computer Science – Data Structures and Algorithms
Scientific paper
2009-03-20
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Delporte-Gallet Carole
Fauconnier Hugues
Tielmann Andreas
No associations
LandOfFree
Fault-Tolerant Consensus in Unknown and Anonymous Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fault-Tolerant Consensus in Unknown and Anonymous Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault-Tolerant Consensus in Unknown and Anonymous Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-641727