Communications of the ACM
A comparison of reliable multicast protocols
Multimedia Systems
Byzantine-resistant total ordering algorithms
Information and Computation
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
The SecureRing group communication system
ACM Transactions on Information and System Security (TISSEC)
Multicast Networking and Applications
Multicast Networking and Applications
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Communication Support for Reliable Distributed Computing
Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
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
Dynamic reduction algorithms for fault tolerant convergent voting with hybrid faults
Dynamic reduction algorithms for fault tolerant convergent voting with hybrid faults
Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts
IEEE Transactions on Software Engineering
Video multicast over the Internet
IEEE Network: The Magazine of Global Internetworking
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Evaluating multicast resilience in carrier Ethernet
WSEAS Transactions on Circuits and Systems
An efficient zone-based multicast routing protocol for ad hoc network
WSEAS TRANSACTIONS on COMMUNICATIONS
| 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 + b + 2, where t and b are the number of malicious and benign faulty hosts, respectively. 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. Furthermore, it is shown that each additional network segment requires (2tg + 1) gateways, where tg indicates the number of faulty gateways.