LE-SBCC: Loss-Event Oriented Source-Based Multicast Congestion Control

  • Authors:
  • Puneet Thapliyal; Sidhartha;Jiang Li;Shivkumar Kalyanaraman

  • Affiliations:
  • Rensselaer Polytechnic Institute, Troy, NY 12180, USA;Rensselaer Polytechnic Institute, Troy, NY 12180, USA;Rensselaer Polytechnic Institute, Troy, NY 12180, USA;Rensselaer Polytechnic Institute, Troy, NY 12180, USA. shivkuma@ecse.rpi.edu

  • Venue:
  • Multimedia Tools and Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Congestion control is an important building block of a Quality of Service (QoS) system for multicast-based multimedia services and applications on the World Wide Web. We propose an end-to-end single-rate source-based multicast congestion control scheme (LE-SBCC) for reliable or unreliable multicast transport protocols. It addresses all the pieces of the single-rate multicast congestion control problem including drop-to-zero issues, TCP friendliness and RTT estimation. The scheme design consists of a cascaded set of filters and a rate-based additive-increase multiplicative-decrease (AIMD) module. These filters together transform the multicast tree to appear like a unicast path for the purposes of congestion control. Unlike TCP, the scheme is not self-clocked but acts upon a stream of loss indications (LIs) from receivers. These LIs are filtered to get a stream of loss events (LEs) (S. Floyd et al., in SIGCOMM 2000, Aug. 2000) (at most one per RTT per receiver). This LE stream is further filtered to extract the maximum LEs from any one receiver. Then the scheme effects at most one rate-reduction per round trip time (RTT). A range of results (simulation and experimental) is presented and compared against the mathematical model of the scheme components. Furthermore, we have successfully adapted TFRC (Op. cit) to our scheme, which is important to multimedia services desiring relatively stable rates over short time scales.