Learn More
This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been(More)
The purpose of multicast routing is to reduce the communication costs for applications that send the same data to multiple recipients. Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed(More)
20 provide the lowest latency and do not require host adapter buuer allocation. However, they require various degrees of complexity in crossbar switch implementation, in order to process source multicast addresses and prevent new types of deadlocks caused by the simultaneous use of multiple paths. None of the proposed schemes can be directly implemented in(More)
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed <italic>sparsely</italic> across a wide area, these schemes are not efficient; data packets or membership report information are(More)
—Scalable reliable multicast (SRM) is a framework for reliable multicast delivery. In order to maximize the collaboration among the group members in error recovery, both retransmission requests and replies are multicast to the entire group. While SRM effectively uses random timers to suppress duplicate requests and replies, the global nature of the request(More)
SRM is a generic framework for reliable multicast data delivery. The retransmission requests and replies used in SRM error recovery are multicast to the entire group. SRM uses random timers to avoid the message implosion problem, and the eeectiveness of SRM's duplicate suppression depends critically on the design of these random timers. In order to achieve(More)
  • 1