{'fraction_non_alphanumeric': 0.0106544901065449, 'fraction_numerical': 0.0, 'mean_word_length': 4.875, '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}}
Using congestion graphs to analyze the stability of network congestion control

In this paper we apply the analysis of delay differential systems to congestion control of computer networks. We represent the congestion of the network as a set of graphs and use that structure to define a matrix equation that represents the queue dynamics of a computer network. We first apply the technique to analytical analysis of first-order delay differential dynamics and then show how the method can be extended to numerical analysis of higher-order dynamics. The network model and control are based on a continuous-time fluid flow model of network traffic data rates.