Performance study of Byzantine Agreement Protocol with artificial neural network

Citation

Lee, Kok-Wah and Ewe, Hong-Tat (2007) Performance study of Byzantine Agreement Protocol with artificial neural network. Information Sciences, 177 (21). pp. 4785-4798.

Full text not available from this repository.

Abstract

nce 1982, numerous Byzantine Agreement Protocols (BAPs) have been developed to solve arbitrary faults in the Byzantine Generals Problem (BGP). A novel BAP, using an artificial neural network (ANN), was proposed by Wang and Kao. It requires message exchange rounds similar to the traditional BAP and its suitability, in the context of network size, has not been investigated. In the present study, we propose to adopt Nguyen-Widrow initialization in ANN training, which modifies message communication and limits the message exchange rounds to three rounds. This modified approach is referred to as BAP-ANN. The BAP-ANN performs better than the traditional BAP, when the network size n is greater than nine. We also evaluate the message exchange matrix (MEM) constructed during the message exchange stage. For a fixed number of faulty nodes and remainder cases of (n mod 3), the study shows that the mean epoch for ANN training decreases as the network size increases, which indicates better fault tolerance. (c) 2007 Elsevier Inc. All rights reserved.

Item Type: Article
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 26 Sep 2011 03:10
Last Modified: 26 Sep 2011 03:10
URII: http://shdl.mmu.edu.my/id/eprint/2990

Downloads

Downloads per month over past year

View ItemEdit (login required)