Tight bounds for FEC-based reliable multicast

  • Authors:
  • Hagit Attiya;Hadas Shachnai

  • Affiliations:
  • Department of Computer Science, The Technion, Haifa 32000, Israel;Department of Computer Science, The Technion, Haifa 32000, Israel

  • Venue:
  • Information and Computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of reliable multicast of a message to a set of receivers over a network that uses best effort transmission (e.g., ATM), based on forward error correcting codes (FEC). We prove lower bounds on the time and message complexities of any algorithm for the problem. We present a synchronous randomized algorithm which guarantees the reliable multicast of a packet of size m to n receivers within O(log n) steps, and whose expected message complexity is O(log m). Its storage complexity is linear in the size of the original packet. The average message and time complexities of the algorithm are within a constant multiplicative factor of the lower bounds.