RASM: A Reliable Algorithm for Scalable Multicast

Download Now Free registration required

Executive Summary

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, the authors propose RASM, a scalable distributed protocol for application-level multicast. Their protocol is based on the combination of gossip-based and tree-based multicast schemes.

  • Format: PDF
  • Size: 1575.9 KB