Log-based receiver-reliable multicast for distributed interactive simulation
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
An error control scheme for large-scale multicast applications
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Local error recovery in SRM: comparison of two approaches
IEEE/ACM Transactions on Networking (TON)
Distributed Algorithms
A Formal Venture into Reliable Multicast Territory
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
OTERS: (On-Tree Efficient Recovery using Subcasting): A Reliable Multicast Protocol
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
RMTP: a reliable multicast transport protocol
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
A Formal Venture into Reliable Multicast Territory
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Synthesis of fault-tolerant concurrent programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
In this paper, we present a formal model of the reliable multicast service that ensures eventual packet delivery with, possibly, some timeliness guarantees. This model dictates precisely what it means to be a member of the reliable multicast group and which packets are guaranteed delivery to which members of the group. Moreover, it is reasonable, implementable, and broad; that is, it captures the intended behavior of numerous reliable multicast protocols. We also present a formal model of the Scalable Reliable Multicast (SRM) protocol [1]. We show that our model of SRM is safe, in the sense that it is a faithful implementation of our model of the reliable multicast service; that is, it may only deliver appropriate packets to each member of the reliable multicast group. We also show that, under certain constraints, the implementation is live, in the sense that it guarantees the timely delivery of the appropriate packets to the appropriate members of the reliable multicast group.