Chasing the FLP impossibility result in a LAN or how robust can a fault tolerant server be?

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2001, Pages 190-193

  Urban P ^a   Defago X ^a   Schiper, A ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEM RECOVERY; DATA COMMUNICATION SYSTEMS; LOCAL AREA NETWORKS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; TELECOMMUNICATION SERVICES;

ASYNCHRONOUS SYSTEM; ATOMIC BROADCAST; FAULT TOLERANT SERVER;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0035200058     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Implementing fault-tolerant services using the state machine approach: A tutorial
2. The primary-backup approach
3. Fault-tolerant broadcasts and related problems
4. Impossibility of distributed consensus with one faulty process
5. Unreliable failure detectors for reliable distributed systems
6. On the impossibility of group membership
7. Solving consensus using Chandra-Toueg's unreliable failure detectors: A general quorum-based approach
8. Early consensus in an asynchronous system with a weak failure detector
9. Neko: A single environment to simulate and prototype distributed algorithms
10. Chasing the FLP impossibility result in a LAN, or how robust can a fault tolerant server be?