A model, analysis, and protocol framework for soft state-based communication
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Implementing a replicated service with group communication
Journal of Systems Architecture: the EUROMICRO Journal
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Integrating heterogeneous information services using JNDI
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
There are many methods for making a multicast protocol "reliable". At one end of the spectrum, a reliable multicast protocol might offer atomicity guarantees, such as all-or-nothing delivery, delivery ordering, and perhaps additional properties such as virtually synchronous addressing. At the other are protocols that use local repair to overcome transient packet loss in the network, offering ''best effort'' reliability. In this paper, we propose a new definition of reliability and offer an implementation of a protocol satisfying the definition (the definition requires certain network properties, but reasonable ones). Our protocol is similar to local repair protocols for the Internet, and like them, is extremely scalable. However, the form of reliability proposed is unusual for offering stable throughput under conditions that can dramatically degrade throughput when using atomic multicast. Bimodal multicast is well adapted to a class of applications for which previous forms of reliable multicast were fundamentally ill-matched.