• DocumentCode
    3255883
  • Title

    Achieving Byzantine agreement in a generalized network model

  • Author

    Wang, Stanley C. ; Chin, Y.H. ; Yan, K.Q. ; Chen, Ci

  • Author_Institution
    Dept. of Comput. Eng., Nat. Chiao Tung Univ., Hsinchu
  • fYear
    1989
  • fDate
    8-12 May 1989
  • Abstract
    Traditionally, the Byzantine agreement (BA) problem has been studied either in a fully connected network or in a broadcast network. A generalized network model for BA is proposed. The conventional fully connected network or broadcast network is a special case of the new network architecture. A BA problem with the processor in a malicious fault is studied in the model. The proposed protocol incorporates the previous protocols developed for a fully connected network or a broadcast network, solves a BA problem by using the minimum number of rounds, and can tolerate the maximum number of faulty processors
  • Keywords
    protocols; Byzantine agreement; broadcast network; faulty processors; fully connected network; generalized network model; protocol; Broadcasting; Computer networks; Computer science; Councils; Distributed processing; Fault diagnosis; Fault tolerance; Hardware; Intelligent networks; Protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    CompEuro '89., 'VLSI and Computer Peripherals. VLSI and Microelectronic Applications in Intelligent Peripherals and their Interconnection Networks', Proceedings.
  • Conference_Location
    Hamburg
  • Print_ISBN
    0-8186-1940-6
  • Type

    conf

  • DOI
    10.1109/CMPEUR.1989.93460
  • Filename
    93460