Congestion Control for RTP Media: a Comparison on Simulated Environment

TL;DR

This paper compares three RTP congestion control algorithms—NADA, GCC, and SCReAM—in a simulated environment, analyzing their performance in terms of fairness, stability, and efficiency for real-time media transmission.

Contribution

It provides a comparative analysis of NADA, GCC, and SCReAM algorithms, highlighting their strengths and weaknesses in simulated network conditions.

Findings

GCC exhibits good fairness and handles lossy links well.

NADA stabilizes quickly but has a late-comer effect.

SCReAM minimizes queue occupation but has lower link utilization.

Abstract

To develop low latency congestion control algorithm for real time taffic has been gained attention recently. RTP Media Congestion Avoidance Techniques (RMCAT) working group was initiated for standard defination. There are three algorithms under this group, Network Assisted Dynamic Adaptation (NADA) proposed by Cisco, Google Congestion Control (GCC) proposed by Google and Self-Clocked Rate Adaptation for Multimedia(SCReAM) proposed by Ericsson. This paper compares and analyses the performance of these algorithms on simulation environment. Results show GCC has well fairness property and performs well in lossy link but slow convergence in dynamic link, NADA stabilizes its rate quickly but suffers "late-comer" effect, SCReAM has the lowest queue occupation but also lower link capacity utilization.