Access cost for asynchronous Byzantine quorum systems

被引:0
|
作者
Rida A. Bazzi
机构
[1] Department of Computer Science and Engineering,
[2] Arizona State University,undefined
[3] Tempe,undefined
[4] AZ 85287–5406,undefined
[5] USA (e-mail: bazzi@asu.edu) ,undefined
来源
Distributed Computing | 2001年 / 14卷
关键词
Key words:Quorum – Fault tolerance – Byzantine failures – Distributed systems – Asynchronous – Access cost;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:41 / 48
页数:7
相关论文
共 50 条
  • [1] Access cost for asynchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 2001, 14 (01) : 41 - 48
  • [2] Non-locking asynchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 1999, 1693 : 109 - 122
  • [3] Byzantine quorum systems
    Malkhi, D
    Reiter, M
    DISTRIBUTED COMPUTING, 1998, 11 (04) : 203 - 213
  • [4] Small Byzantine quorum systems
    Martin, JP
    Alvisi, L
    Dahlin, M
    INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS, PROCEEDINGS, 2002, : 374 - 383
  • [5] 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 - +
  • [6] 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 - +
  • [7] 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
  • [8] Synchronous Byzantine quorum systems
    Rida A. Bazzi
    Distributed Computing, 2000, 13 : 45 - 52
  • [9] Synchronous Byzantine quorum systems
    Bazzi, RA
    DISTRIBUTED COMPUTING, 2000, 13 (01) : 45 - 52
  • [10] The load and availability of Byzantine quorum systems
    Malkhi, D
    Reiter, MK
    Wool, A
    SIAM JOURNAL ON COMPUTING, 2000, 29 (06) : 1889 - 1906