TMRCC

Abstract

The proliferation of the Internet and the growing interest in the multi-user collaborative applications and multi-process interaction applications has led to the emergence of many-to-many reliable multicast. Congestion control is a key task in reliable multicast along with error control. However, existing congestion control schemes are designed for one-to-many reliable multicast and have some drawbacks when they are used for tree-based many-to-many reliable multicast. We propose an efficient congestion control mechanism, $\emph{TMRCC}$, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly. The performance of the proposed scheme is evaluated using network simulator 2, ns-2 [2]. and performing experiments in a test network implementing TMRCC with a tree-based many-to-many reliable multicast protocol, GAM [18]. The evaluation results show that the proposed scheme outperforms TRAMCC in terms of intra-session fairness and good level of responsiveness, TCP-friendliness, and scalability.