STOPPING-TIMES OF DISTRIBUTED CONSENSUS PROTOCOLS - A PROBABILISTIC ANALYSIS

被引：3
作者：
BABAOGLU, O
机构：
[1] Cornell Univ, Ithaca, NY, USA, Cornell Univ, Ithaca, NY, USA
来源：
INFORMATION PROCESSING LETTERS | 1987年 / 25卷 / 03期
关键词：
722 Computer Systems and Equipment - 723 Computer Software; Data Handling and Applications - 922 Statistical Methods;
D O I：
10.1016/0020-0190(87)90127-X
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：163 / 169
页数：7
相关论文
共 11 条
  • [1] Dolev D., 1982, 23rd Annual Symposium on Foundations of Computer Science, P196, DOI 10.1109/SFCS.1982.51
  • [2] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT
    DOLEV, D
    STRONG, HR
    [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 656 - 666
  • [3] DWORK C, 1986, COMMUNICATION JAN
  • [4] Feller W, 1971, INTRO PROBABILITY TH
  • [5] FISCHER M, 1983, YALEUDCSRR273 YAL U
  • [6] HADZILACOS V, 1984, TR1184 HARV U AIK CO
  • [7] THE BYZANTINE GENERALS PROBLEM
    LAMPORT, L
    SHOSTAK, R
    PEASE, M
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03): : 382 - 401
  • [8] REACHING AGREEMENT IN THE PRESENCE OF FAULTS
    PEASE, M
    SHOSTAK, R
    LAMPORT, L
    [J]. JOURNAL OF THE ACM, 1980, 27 (02) : 228 - 234
  • [9] ROSS SM, 1970, APPLIED PROBABILITY
  • [10] STRONG HR, 1983, SPR P IEEE COMPCON, P77
12