Probabilistic Multicast

Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. The authors propose a scalable gossip-based multicast algorithm which ensures, with a high probability, that a process interested in a multicast event delivers that event (Just like in typical gossip-based broadcast algorithms), and that a process not interested in that event does not receive it (Unlike in broadcast algorithms).

Provided by: ETH Zurich Topic: Networking Date Added: Jan 2011 Format: PDF

Find By Topic