Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients

• Published in: Distributed Computing pp. 299 - 313
• Main Authors: Bazzi, Rida A., Ding, Yin
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2006; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Applied sciences; Atomic; Byzantine; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Fault Tolerance; Replication; Software; Timestamps; Wait-Free; Input output; Semantics; Worst case method; Data storage; Storage system; Failure detection; Infinite system; Distributed computing; Two server queue; Bounded solution

We present the first direct bounded wait-free implementation of a replicated register with atomic semantics in a system with an unbounded number of clients and in which up to f servers are subject to Byzantine failures. In a system with n ≥4f+i+1 servers, and in the presence of a single writer, our...