Byzantine-resistant total ordering algorithms
Information and Computation
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
| Hi-index | 0.00 |
Despite the increasing number of applications that benefit from multicasting, most reliable multicast protocols consider omission faults only. This research is concerned with survivability of multicast communication where the communication medium is shared among the hosts. The approach presented specifies that a network with n nodes is resistant against network omissions and malicious nodes if n ≥ 2t + 2, where t is the number of malicious faults. The simulation results show that the network traffic is dynamically adapted to the rate of faults and that the network performs well under omission and malicious faults, unless the rate of faults is high.