Probabilistic quorum systems

被引：70
|
作者：
Malkhi, D [1 ]
Reiter, MK
Wool, A
Wright, RN
机构：
[1] Hebrew Univ Jerusalem, Sch Comp Sci & Engn, Jerusalem, Israel
[2] Bell Labs, Lucent Technol, Murray Hill, NJ USA
[3] AT&T Labs Res, Florham Pk, NJ USA
来源：
INFORMATION AND COMPUTATION | 2001年 / 170卷 / 02期
关键词：
D O I：
10.1006/inco.2001.3054
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We initiate the study of probabilistic quorum systems, a technique for providing consistency of replicated data with high levels of assurance despite the failure of data servers. We show that this technique offers effective load reduction on servers and high availability. We explore probabilistic quorum systems both for services tolerant of benign server failures and for services tolerant of arbitrary (Byzantine) ones. We also prove bounds on the server load that ca be achieved with these techniques. (C) 2001 Academic Press.
引用
收藏
页码：184 / 206
页数：23
相关论文
共 50 条
  • [21] Dynamic Byzantine quorum systems
    Alvisi, L
    Malkhi, D
    Pierce, E
    Reiter, MK
    Wright, RN
    DSN 2000: INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2000, : 283 - 292
  • [22] Evaluating Byzantine quorum systems
    Dantas, Wagner Saback
    Bessani, Alysson Neves
    Fraga, Joni da Silva
    Correia, Miguel
    SRDS 2007: 26TH IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, : 253 - +
  • [23] Revisiting hierarchical Quorum systems
    Preguiça, N
    Martins, JL
    21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2001, : 264 - 272
  • [24] Proactive Byzantine Quorum Systems
    Alchieri, Eduardo A. P.
    Bessani, Alysson Neves
    Pereira, Fernando Carlos
    Fraga, Joni da Silva
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2009, PT 1, 2009, 5870 : 708 - +
  • [25] Synchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 2000, 13 (01) : 45 - 52
  • [26] Load balancing in quorum systems
    Holzman, R
    Marcus, Y
    Peleg, D
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (02) : 223 - 245
  • [27] Load balancing in quorum systems
    Holzman, R
    Marcus, Y
    Peleg, D
    ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 38 - 49
  • [28] Brief announcement: An adaptive randomised searching protocol in peer-to-peer systems based on probabilistic weak quorum system
    Wu, Yu
    Izumi, Taisuke
    Ooshita, Fukuhito
    Kakugawa, Hirotsugu
    Masuzawa, Toshimitsu
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2006, 4280 : 586 - +
  • [29] Probabilistic Consistency Guarantee in Partial Quorum-Based Data Store
    Yao, Xin
    Wang, Cho-Li
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2020, 31 (08) : 1815 - 1827
  • [30] A dynamic probe strategy for quorum systems
    Neilsen, ML
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1997, : 95 - 99
12345