{'fraction_non_alphanumeric': 0.024271844660194174, 'fraction_numerical': 0.0012135922330097086, 'mean_word_length': 5.6, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Quantifying the transient performance of congestion control algorithms

Congestion control algorithms (CCA) are devoted to improve their performance on long-term metrics (e.g., throughput, fairness), whereas the increasing low-latency application demand poses strict requirements on and motivates us to evaluate the transient performance of CCAs. However, due to the complexity of existing CCAs and changeable network conditions, it is challenging to quantify the transient performance. Our observation is that the transient performance could be modelled as damped oscillations. In this poster, we propose a framework to quantify the transient performance by calculating the extent of the damped oscillation. We use our framework to evaluate 3 widely-deployed CCAs and offer a comparison between their transient performance.