{'fraction_non_alphanumeric': 0.014145810663764961, 'fraction_numerical': 0.0, 'mean_word_length': 4.974025974025974, '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}}
Analysis of a rate-based control strategy with delayed feedback

In this paper we analyze a class of delayed feedback schemes that achieves the dual goal of keeping buffers small and utilizations high, despite propagation delays and regardless of network rates. We analyze delayed feedback schemes as a system of delay-differential equations, in which we model the queue-length process and the rate at which a source transmits data as fluids. We assume that a stream of acknowledgements carries information about the state of a bottleneck queue back to the source, which adapts its transmission rate according to any monotone function of that state. We show stability for this class of schemes, in that their rate of transmission and queue length rapidly converge to a small neighborhood of the designed operating point. We identify the appropriate scaling of the model's parameters for the system to perform optimally.