The process group approach to reliable distributed computing
Communications of the ACM
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
The Transis approach to high availability cluster communication
Communications of the ACM
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Security Mechanisms in High-Level Network Protocols
ACM Computing Surveys (CSUR)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Total Ordering Algorithms for Asynchronous Byzantine Systems
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
The Magic Words are Squeamish Ossifrage
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Byzantine Fault Tolerance Can Be Fast
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
A Framework to Support Survivable Web Services
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
| Hi-index | 0.00 |
A reliable multicast protocol enables a process to multicast a message to a group of processes in a way that ensures that all honest destination-group members receive the same message, even if some group members and the multicast initiator are maliciously faulty. Reliable multicast has been shown to be useful for building multiparty cryptographic protocols and secure distributed services. We present a high-throughput reliable multicast protocol that tolerates the malicious behavior of up to fewer than one-third of the group members. Our protocol achieves high-throughput using a novel technique for chaining multicasts, whereby the cost of ensuring agreement on each multicast message is amortized over many multicasts. This is coupled with a novel flow-control mechanism that yields low multicast latency.