• DocumentCode
    2430328
  • Title

    Achieving Byzantine agreement in a processor and link fallible network

  • Author

    Yan, K.Q. ; Chin, Y.H.

  • Author_Institution
    Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
  • fYear
    1989
  • fDate
    22-24 March 1989
  • Firstpage
    407
  • Lastpage
    412
  • Abstract
    Traditionally, the Byzantine agreement (BA) problem is solved in a fully connected network with processor failure only. The BA problem is reexamined under the syndrome of malicious fault on both processor and link. The proposed protocol FGEN can solve the BA problem for the failure of processor/link. The authors also prove that the protocol requires the minimum number of rounds and can tolerate the maximum number of allowable faulty components.<>
  • Keywords
    fault tolerant computing; protocols; Byzantine agreement; fully connected network; link fallible network; processor; protocol FGEN; Computer crashes; Computer networks; Fault diagnosis; Intelligent networks; Protocols; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
  • Conference_Location
    Scottsdale, AZ, USA
  • Print_ISBN
    0-8186-1918-x
  • Type

    conf

  • DOI
    10.1109/PCCC.1989.37423
  • Filename
    37423