{'fraction_non_alphanumeric': 0.013937282229965157, 'fraction_numerical': 0.0, 'mean_word_length': 5.182795698924731, '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}}
The stability of a class of network congestion control algorithms based on optimization theorem

Distributed congestion control is the hot topic in computer network research. A primal-dual generic model with boundary limit is introduced to describe a class of congestion control algorithms based on optimization theorem. Considering the influence of the boundary, the conditions of the system equilibrium are proposed and the stability of the model without time delay is analyzed in generic network structure. The results are validated through an example of TCP/E-RED model.