Byzantine quorum systems with maximum availability

被引:3
|
作者
Tsuchiya, T [1 ]
Kikuno, T [1 ]
机构
[1] Osaka Univ, Dept Informat & Math Sci, Toyonaka, Osaka 5608531, Japan
关键词
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 条
  • [41] Signed quorum systems
    Haifeng Yu
    Distributed Computing, 2006, 18 : 307 - 323
  • [42] Refined Quorum Systems
    Guerraoui, Rachid
    Vukolic, Marko
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 119 - 128
  • [43] Refined quorum systems
    Rachid Guerraoui
    Marko Vukolić
    Distributed Computing, 2010, 23 : 1 - 42
  • [44] Signed quorum systems
    Yu, HF
    DISTRIBUTED COMPUTING, 2006, 18 (04) : 307 - 323
  • [45] Probabilistic quorum systems
    Malkhi, D
    Reiter, MK
    Wool, A
    Wright, RN
    INFORMATION AND COMPUTATION, 2001, 170 (02) : 184 - 206
  • [46] Increasing the Accuracy of Cost and Availability Predictions of Quorum Protocols
    Schadek, Robert
    Theel, Oliver
    2017 IEEE 22ND PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING (PRDC 2017), 2017, : 98 - 103
  • [47] Refined quorum systems
    Guerraoui, Rachid
    Vukolic, Marko
    DISTRIBUTED COMPUTING, 2010, 23 (01) : 1 - 42
  • [48] Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
    King, Valerie
    Lonargan, Steven
    Saia, Jared
    Trehan, Amitabh
    DISTRIBUTED COMPUTING AND NETWORKING, 2011, 6522 : 203 - +
  • [49] Maximum Metric Spanning Tree Made Byzantine Tolerant
    Dubois, Swan
    Masuzawa, Toshimitsu
    Tixeuil, Sebastien
    DISTRIBUTED COMPUTING, 2011, 6950 : 150 - +
  • [50] Maximum Metric Spanning Tree Made Byzantine Tolerant
    Swan Dubois
    Toshimitsu Masuzawa
    Sébastien Tixeuil
    Algorithmica, 2015, 73 : 166 - 201