scientific article; zbMATH DE number 2013839

MaRDI QIDQ4437133zbMATH OpenFDO

Authors Jean-Philippe Martin, Lorenzo Alvisi, Mike Dahlin

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2508/25080311.htm

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
• Remote storage with Byzantine servers
• Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
• Distributed Computing
• Byzantine quorum systems

Cited in

(12)

• Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
• Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
• A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum
• Optimistic Erasure-Coded Distributed Storage
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Integrated bounds for disintegrated storage
• A coded shared atomic memory algorithm for message passing architectures
• Remote storage with Byzantine servers
• Wait-free regular storage from Byzantine components
• Refined quorum systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437133)