EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS

被引：0
|
作者：
FISCHER, MJ
LYNCH, NA
MERRITT, M
机构：
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
[2] AT&T BELL LABS,MURRAY HILL,NJ 07974
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 448卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Easy proofs are given of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs. It is shown that, in the presence of f faults, no solution of these problems exists for communication graphs with fewer than 3f+1 nodes or less than 2f+1 connectivity. While some of these results had been proven previously, the new proofs are much simpler, provide considerably more insight, apply to more general models of computation, and (particularly in the case of clock synchronization) significantly strengthen the results.
引用
收藏
页码：147 / 170
页数：24
相关论文
共 50 条
  • [1] EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS
    FISCHER, MJ
    LYNCH, NA
    MERRITT, M
    [J]. DISTRIBUTED COMPUTING, 1986, 1 (01) : 26 - 39
  • [2] Distributed Computing Theory: Algorithms, Impossibility Results, Models, and Proofs
    Lynch, Nancy
    [J]. STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 247 - 247
  • [3] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
    FISCHER, MJ
    LYNCH, NA
    PATERSON, MS
    [J]. JOURNAL OF THE ACM, 1985, 32 (02) : 374 - 382
  • [4] Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
    Biely, Martin
    Robinson, Peter
    Schmid, Ulrich
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 299 - +
  • [5] Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
    Biely, Martin
    Robinson, Peter
    Schmid, Ulrich
    [J]. PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 227 - 228
  • [6] Truthmaking, Evidence Of, and Impossibility Proofs
    Heathcote, Adrian
    [J]. ACTA ANALYTICA-INTERNATIONAL PERIODICAL FOR PHILOSOPHY IN THE ANALYTICAL TRADITION, 2014, 29 (03): : 363 - 375
  • [7] Truthmaking, Evidence Of, and Impossibility Proofs
    Adrian Heathcote
    [J]. Acta Analytica, 2014, 29 : 363 - 375
  • [8] Brief proofs of Arrovian impossibility theorems
    Susumu Cato
    [J]. Social Choice and Welfare, 2010, 35 : 267 - 284
  • [9] Brief proofs of Arrovian impossibility theorems
    Cato, Susumu
    [J]. SOCIAL CHOICE AND WELFARE, 2010, 35 (02) : 267 - 284
  • [10] Impossibility proofs for RSA signatures in the standard model
    Paillier, Pascal
    [J]. Topics in Cryptology - CT-RSA 2007, Proceedings, 2007, 4377 : 31 - 48
12345