Bimodal multicast

@article{Birman1999BimodalM,
  title={Bimodal multicast},
  author={Kenneth P. Birman and Mark Hayden and {\"O}znur {\"O}zkasap and Zhen Xiao and Mihai Budiu and Yaron Minsky},
  journal={ACM Trans. Comput. Syst.},
  year={1999},
  volume={17},
  pages={41-88}
}
There are many methods for making a multicast protocol “reliable.” At one end of the spectrum, a reliable multicast protocol might offer tomicity 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. Yet none of this prior work has treated stability of multicast delivery as a… 

Performance study of a probabilistic multicast transport protocol

Probabilistic reliable multicast in ad hoc networks

An Application-Controlled Framework for Reliable Multicast Transport

A novel framework approach to RM protocol design that involves a generic core protocol skeleton that can be customized in different ways resulting in protocols that are optimized for specific applications is proposed.

Network Traffic Properties of Bimodal Multicast Protocol

Simulation studies demonstrate that epidemic approach of Bimodal Multicast generates short-range dependent traffic with low overhead traffic and transport delays, and elaborate on the protocol mechanisms as an underlying factor in the empirical results.

Network Traffic Properties of Bimodal Multicast Protocol

Simulation studies demonstrate that epidemic approach of Bimodal Multicast generates short-range dependent traffic with low overhead traffic and transport delays, and elaborate on the protocol mechanisms as an underlying factor in the empirical results.

Route driven gossip: probabilistic reliable multicast in ad hoc networks

  • Jun LuoP. EugsterJ. Hubaux
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
This work presents a protocol that is designed to meet a more practical specification of probabilistic reliability, called route driven gossip (RDG), which is custom-tailored to ad hoc networks, achieving a high level of reliability without relying on any inherent multicast primitive.

Throughput Stability of Reliable Multicast Protocols

This paper describes an experimental model developed for Pbcast and virtually synchronous protocols on a real system, and gives the analysis results of this study.

Scalability of Two Reliable Multicast Protocols

It is confirmed that SRM scales poorly under some conditions: to obtain reliability, the protocol incurs overhead linear in group size and throughput fluctuates erratically, and it is also shown thatSRM latencies can be very large and that latency distributions are unstable as a function of group sizes and network topology.

Efficient Error Recovery for Reliable Multicast

This dissertation presents a randomized reliable multicast protocol called RRMP which has demonstrably achieved several good properties and eliminates message implosion, improves the robustness of the system against process failures and optimizes buffer management through an innovative two-phase buffering algorithm.
...

References

SHOWING 1-10 OF 65 REFERENCES

Error recovery in scalable reliable multicast

This thesis started with the receiver-initiated reliable delivery model in SRM and investigates error recovery mechanisms to improve the efficiency and the scalability, and presents two approaches to local recovery: hop-based scope control and use of local recovery groups.

Scalability of Two Reliable Multicast Protocols

It is confirmed that SRM scales poorly under some conditions: to obtain reliability, the protocol incurs overhead linear in group size and throughput fluctuates erratically, and it is also shown thatSRM latencies can be very large and that latency distributions are unstable as a function of group sizes and network topology.

Efficient data distribution in large-scale multicast networks

This dissertation presents MESH: a novel, distributed transport protocol designed for large-scale multicast, and designs and implements a reliable protocol and a deadline-driven reliable protocol in a high-fidelity simulation of SURAnet and vBNSnet.

A reliable multicast framework for light-weight sessions and application level framing

An adaptive algorithm is demonstrated that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery, and provides good performance over a wide range of underlying topologies.

A review of experiences with reliable multicast

It is found that to reach a broad user community (and a commercially interesting market) the technology must be better integrated with component and object-oriented systems architectures and its scalability and performance are pointed to.

RMTP: a reliable multicast transport protocol

  • J. LinS. Paul
  • Computer Science
    Proceedings of IEEE INFOCOM '96. Conference on Computer Communications
  • 1996
RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers by using a packet-based selective repeat retransmission scheme, in which each acknowledgment packet carries a sequence number and a bitmap.

A review of experiences with reliable multicast

  • K. Birman
  • Computer Science
    Softw. Pract. Exp.
  • 1999
It is found that to reach a broad user community (and a commercially interesting market) the technology must be better integrated with component and object‐oriented systems architectures and some assumptions about failure handling make reliable multicast difficult to exploit.

Scalable message stability detection protocols

This dissertation proposes a new gossip-style protocol with improved scalability and fault tolerance in message stability detection protocols and shows that by adding a hierarchical structure to the set of basic protocols, their performance can be significantly improved when the number of participants is large.

Probabilistic Broadcast

A class of scalable and probabilisticly reliable communication protocols is presented which is strongly self-stabilizing in a sense similar, although not identical to, the notion of self stabilizing systems proposed by Dijkstra.

ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT

A systematic derivation of a family of atomic broadcast protocols that are tolerant of increasingly general failure classes: omission failures, timing failures, and authentication-detectable Byzantine failures and can tolerate any number of link and process failures up to network partitioning is presented.
...