RASM: A Reliable Algorithm for Scalable Multicast

M. Allani, J. Leitão, B. Garbinato and L. Rodrigues

Selected sections of this report were published in the Proceedings of the 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP), Italy, Pisa, Feb, 2010.

Abstract

Recently there has been an effort to build scalable and reliable application-level multicast solutions that combine the resilience of pure gossip-based with the efficiency of tree-based schemes. However, such solutions assume that participants have unlimited resources, for instance, that they can send an unbounded number of messages to mask network omissions. Such scenario is not realistic, specially for streaming protocols, where messages can be transmitted at a very high rate and have a small temporal validity.

In this paper, we propose RASM, a scalable distributed protocol for application-level multicast. Our protocol is based on the combination of gossip-based and tree-based multicast schemes. Unlike previous approaches, which strive to combine gossip-based and tree-based schemes, our solution takes into consideration the reliability of components: nodes and communication links can fail, unexpectedly, ceasing their operation and dropping messages, respectively. Experimental results show that our scheme offers better reliability than previous solutions with low overhead.

Also available extended report (pdf)

Luís Rodrigues