General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • APC: 800 USD
    • E-mail: ijcte@iacsitp.com
    • Journal Metrics:
    • SCImago Journal & Country Rank
Editor-in-chief
Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2015 Vol.7(2): 120-125 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2015.V7.942

New Approach to Improve the Generalized Byzantine Agreement Problem

Hui-Ching Hsieh and Mao-Lun Chiang

Abstract—To achieve reliability, it is very important to study the agreement and fault-tolerance topic in distributed systems. This kind of problem is known as a Byzantine Agreement (BA) problem. It requires a set of processors to agree on a common value, even if some processors and transmission media are faulty. Basically, the traditional BA protocols require ∟(n-1)/3」+ 2 rounds of message exchange to make each processor reach an agreement. In other words, those protocols are inefficient and unreasonable, due to the number of message results in a large protocol overhead. In this study, we propose a novel and efficient protocol to reduce the amount of messages. Our protocol can compare and replace the messages received from other processors to find out the reliable processors and replace the value sent by the un-reliable processors through four rounds of message exchange even when the total number of faulty components or the total number of processors in the system is large. Finally, the agreement can be reached by using the minimum number of messages in the distributed system, while tolerating the maximum number of faulty components.

Index Terms—Byzantine agreement problem, fault-tolerance, distributed system.

Hui-Ching Hsieh is with the Department of Information Communication, Hsing Wu Universitiy, No. 101, Sec.1, Fenliao Rd., Lin Kou District, New Taipei City 244, Taiwan, R.O.C. (e-mail: luckyeva.hsieh@gmail.com).
Mao-Lun Chiang is with the Department of Information and Communication Engineering, Chaoyang University of Technology 168, Jifeng E. Rd., Wufeng District, Taichung County, 41349 Taiwan, R.O.C (e-mail: mlchiang@cyut.edu.tw).

[PDF]

Cite: Hui-Ching Hsieh and Mao-Lun Chiang, "New Approach to Improve the Generalized Byzantine Agreement Problem," International Journal of Computer Theory and Engineering vol. 7, no. 2, pp. 120-125, 2015.


Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.