{'fraction_non_alphanumeric': 0.02252816020025031, 'fraction_numerical': 0.0, 'mean_word_length': 5.299212598425197, '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}}
STOCHASTICALLY SCALABLE FLOW CONTROL

Recent advances in the mathematical analysis of flow control have prompted the creation of the Scalable TCP (STCP) and Exponential RED (E-RED) algorithms. These are designed to be scalable under the popular deterministic delay stability modeling framework. In this article, we analyze stochastic models of STCP and STCP combined with E-RED link behavior. We find that under certain plausible network conditions, these probabilistic models also exhibit scalable behavior. In particular, we derive parameter choice schemes for which the equilibrium coefficients of variation of flow rates are bounded, however large, fast, or complex the network. Our model is shown to exhibit behavior similar to the mean field convergence that has recently been observed in TCP.