Resilient multicast using overlays

  • Authors:

  • Suman Banerjee;Seungjoon Lee;Bobby Bhattacharjee;Aravind Srinivasan

  • Affiliations:

  • Department of Computer Sciences, University of Wisconsin, Madison, WI;Department of Computer Science, University of Maryland, College Park, MD;Department of Computer Science and the Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Department of Computer Science and the Institute for Advanced Computer Studies, University of Maryland, College Park, MD

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes.As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (97%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1%-5%) and high topology change rates (5 changes per second) while incurring very low overheads (