Avoiding Malicious Byzantine Faults by a New Signature Generation Technique
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
A multiple bus broadcast protocol resilient to non-cooperative Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Multicast survivability in hierarchical broadcast networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
| Hi-index | 0.00 |
A site broadcasting its local value to all other sites ina fault-prone environment is a fundamental paradigm in constructing reliable distributed systems. Time complexity lower bounds and network connectivity requirements for reliable broadcast protocols in point-to-point communication networks are well known. In this paper, we consider the reliable broadcast problem in distributed systems with broadcast networks (for example, Ethernets) as the basic communication architecture. We show how properties of such network architectures can be used to effectively restrict the externally visible behavior of faulty processors. We use these techniques to derive simple protocols that implement reliable broadcast in only two rounds, independent of the failure upper bounds.