DocumentCode
2257523
Title
Circumventing/identifying faults effects
Author
Ayeb, B. ; Farhat, A. ; Kefi, R.
Author_Institution
Fac. of Sci., Sherbrooke Univ., Que., Canada
fYear
2000
fDate
2000
Firstpage
283
Lastpage
290
Abstract
The literature includes a variety of techniques to address the Byzantine Generals Problem or the Byzantine approach. While the main goal within the Byzantine framework is to circumvent and mask the effect of unreliable units (e.g., traitors), much research has been done on identifying (i.e., demasking) unreliable units. This is often called fault identification in system diagnosis. The paper focuses on the identification of unreliable units within the Byzantine framework. Beyond its theoretical interest, an identification of faulty units contributes to accelerating the agreement process itself and drastically reducing the number of messages exchanged between units. The main features of this work are twofold. It does not impose additional assumptions or constraints on the agreement process. It limits the overhead for identifying unreliable units: the identification process is in O(n3)
Keywords
computational complexity; concurrency theory; distributed algorithms; message passing; Byzantine Generals Problem; Byzantine approach; Byzantine framework; agreement process; fault effect circumvention; fault effect identification; fault identification; faulty units; identification process; message exchange; system diagnosis; traitors; unreliable units; Acceleration; Context; Fault diagnosis; Message passing; Redundancy; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 2000. Proceedings. Seventh International Conference on
Conference_Location
Iwate
ISSN
1521-9097
Print_ISBN
0-7695-0568-6
Type
conf
DOI
10.1109/ICPADS.2000.857709
Filename
857709
Link To Document