Research Article
Congestion Control for RTP Media: A Comparison on Simulated Environment
@INPROCEEDINGS{10.1007/978-3-030-32216-8_4, author={Songyang Zhang and Weimin Lei and Wei Zhang and Yunchong Guan}, title={Congestion Control for RTP Media: A Comparison on Simulated Environment}, proceedings={Simulation Tools and Techniques. 11th International Conference, SIMUtools 2019, Chengdu, China, July 8--10, 2019, Proceedings}, proceedings_a={SIMUTOOLS}, year={2019}, month={10}, keywords={Congestion control RTP media congestion control Real time traffic ns3 simulation}, doi={10.1007/978-3-030-32216-8_4} }- Songyang Zhang
Weimin Lei
Wei Zhang
Yunchong Guan
Year: 2019
Congestion Control for RTP Media: A Comparison on Simulated Environment
SIMUTOOLS
Springer
DOI: 10.1007/978-3-030-32216-8_4
Abstract
The audio and video applications based on Real Time Protocol (RTP) have been exploded in recent years. To develop low latency congestion control algorithms for real time traffic to provide better quality of experience and to avoid network congestion has gained much attention. RTP Media Congestion Avoidance Techniques (RMCAT) working group was initiated for proposal draft. Currently, there are three algorithms under this group, Network Assisted Dynamic Adaptation (NADA), Google Congestion Control (GCC) and Self-Clocked Rate Adaptation for Multimedia (SCReAM). This paper integrates the three algorithms into simulated platform and their performances are compared and analyzed. Results show GCC has well fairness property and can maintain quite reasonable packet sending rate in loss link but converges a bit slowly in dynamic link, NADA stabilizes its rate quickly but suffers from “late-comer” effect, SCReAM has the lowest queue occupation but also lower link capacity utilization.