Papers › Congestion Control for RTP Media: a Comparison on Simulated Environment
Congestion Control for RTP Media: a Comparison on Simulated Environment
Songyang Zhang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections