Byzantine quorum systems with maximum availability

被引：3
|
作者：
Tsuchiya, T [1 ]
Kikuno, T [1 ]
机构：
[1] Osaka Univ, Dept Informat & Math Sci, Toyonaka, Osaka 5608531, Japan
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 02期
关键词：
quorum systems; byzantine failures; availability; integer programming; distributed systems;
D O I：
10.1016/S0020-0190(01)00311-8
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
An approach to construct f-masking quorum systems that were optimal with respect to availability was proposed. The problem of computing an optimal masking quorum system as a 0-1 integer programming was formulated. It was found that the threshold system had nearly optimal availability when the number of nodes was odd.
引用
收藏
页码：71 / 77
页数：7
相关论文
共 50 条
  • [11] Access cost for asynchronous Byzantine quorum systems
    Rida A. Bazzi
    Distributed Computing, 2001, 14 : 41 - 48
  • [12] GRADE: Graceful Degradation in Byzantine Quorum Systems
    Lin, Jingqiang
    Luo, Bo
    Jing, Jiwu
    Zhang, Xiaokun
    2012 31ST INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2012), 2012, : 171 - 180
  • [13] Access cost for asynchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 2001, 14 (01) : 41 - 48
  • [14] The availability of crumbling wall quorum systems
    Peleg, D
    Wool, A
    DISCRETE APPLIED MATHEMATICS, 1997, 74 (01) : 69 - 83
  • [15] The load, capacity, and availability of quorum systems
    Naor, M
    Wool, A
    SIAM JOURNAL ON COMPUTING, 1998, 27 (02) : 423 - 447
  • [16] How to Trust Strangers: Composition of Byzantine Quorum Systems
    Alpos, Orestis
    Cachin, Christian
    Zanolini, Luca
    2021 40TH INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2021), 2021, : 120 - 131
  • [17] Non-locking asynchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 1999, 1693 : 109 - 122
  • [18] Constructing Byzantine Quorum systems from combinatorial designs
    Tsuchiya, T
    Ido, N
    Kikuno, T
    INFORMATION PROCESSING LETTERS, 1999, 71 (01) : 35 - 42
  • [19] On the availability of non-strict quorum systems
    Aiyer, A
    Alvizi, L
    Bazzi, RA
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2005, 3724 : 48 - 62
  • [20] Optimal availability quorum systems: Theory and practice
    Amir, Y
    Wool, A
    INFORMATION PROCESSING LETTERS, 1998, 65 (05) : 223 - 228
12345