Network-Assisted Dynamic Adaptation (NADA) is a congestion control scheme (work in progress) for WebRTC. This page highlights the results of coupled congestion control with NADA. Some preliminary results were presented in IETF 92 Dallas. In this page, results (with and without the FSE) based on RMCAT eval criteria are given. The cases that we intend to focus on are as follows.

RMCAT Test Cases

[+] Test 5.2: Variable Available Capacity with Multiple RMCAT flows

The following results show the graphs of RMCAT flows competing at the bottleneck.

Coupled Congestion Control with NADA - with and without the FSE
Type
Without FSE
With FSE
 
[+] Test 5.4: Competing Flows with Same RMCAT Algorithm

The following results show the graphs of RMCAT flows competing at the bottleneck.

Coupled Congestion Control with NADA - with and without the FSE
Type
Without FSE
With FSE
 
[+] Test 5.5: Round Trip Time Fairness

The following results show the graphs for RTT fairness.

Coupled Congestion Control with NADA - with and without the FSE
Type
Without FSE
With FSE
Test 5.5
[+] Test 5.6: RMCAT Flows competing with a long TCP Flow (changed RMCAT Flow to Flows, to show the effect of coupled CC )

The following results show the graphs for two RMCAT flows competing with a long TCP flow.

Coupled Congestion Control - with and without the FSE
Type
Without FSE
With FSE
Test 5.6
[+] Test 5.7: RMCAT Flow competing with short TCP Flows

The following results show the graphs of RMCAT flows competing with short TCP flows.

Coupled Congestion Control with NADA - with and without the FSE
Type
Without FSE
With FSE
 
[+] Test 5.8. Media Pause and Resume

 

Coupled Congestion Control with NADA - with and without the FSE
Type
Without FSE
With FSE
Test 5.8