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.
机构:Princeton Univ, Dep of Electrical, Engineering & Computer Science,, Princeton, NJ, USA, Princeton Univ, Dep of Electrical Engineering & Computer Science, Princeton, NJ, USA
GARCIAMOLINA, H
;
BARBARA, D
论文数: 0引用数: 0
h-index: 0
机构:Princeton Univ, Dep of Electrical, Engineering & Computer Science,, Princeton, NJ, USA, Princeton Univ, Dep of Electrical Engineering & Computer Science, Princeton, NJ, USA
机构:Princeton Univ, Dep of Electrical, Engineering & Computer Science,, Princeton, NJ, USA, Princeton Univ, Dep of Electrical Engineering & Computer Science, Princeton, NJ, USA
GARCIAMOLINA, H
;
BARBARA, D
论文数: 0引用数: 0
h-index: 0
机构:Princeton Univ, Dep of Electrical, Engineering & Computer Science,, Princeton, NJ, USA, Princeton Univ, Dep of Electrical Engineering & Computer Science, Princeton, NJ, USA