Byzantine quorum systems with maximum availability.

DOI10.1016/S0020-0190(01)00311-8MaRDI QIDQ1853046zbMATH OpenFDO

Authors Tatsuhiro Tsuchiya, Tohru Kikuno

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Distributed systemsInteger programmingByzantine failuresAvailabilityQuorum systems

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites work

• Byzantine quorum systems
• How to assign votes in a distributed system
• Optimal coteries for rings and related networks
• The Load and Availability of Byzantine Quorum Systems
• The availability of quorum systems
• Transformations on regular nondominated coteries and their applications

Describes a project that uses

Uses Software

• LINGO
• LINDO

This page was built for publication: Byzantine quorum systems with maximum availability.

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