A window-based congestion control for reliable multicast based on TCP dynamics

  • Authors:
  • Koichi Yano;Steven McCanne

  • Affiliations:
  • University of California, Berkeley;FastForward Networks

  • Venue:
  • MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The limitation of the current multicast model led to the development of embedded network assist and new service models for reliable transport. We show a viable solution for one of the hardest problems in reliable multicast — congestion control — through the deployment of a new forwarding service model, “Breadcrumb forwarding service” (BCFS). Our proposed reliable multicast transport, “Rainbow”, is built on top of this model. In our approach, each receiver maintains its own congestion window and individually runs window control modeled after TCP. To enhance Rainbow's scalability and support asynchronous receiver subscriptions, Rainbow utilizes Digital Fountain at the source. This allows receivers to exercise asynchronous and autonomous behavior while simultaneously enjoying the performance benefit of synchronous multicast communication with fast group establishment of BCFS. In this paper, we detail the congestion control of Rainbow and demonstrate its efficiency and scalability through simulation and analysis. According to simulation results, Rainbow shows more TCP-fair behavior than RLC, which is a TCP friendly congestion control scheme based on layered multicast.