{'fraction_non_alphanumeric': 0.016534391534391533, 'fraction_numerical': 0.0, 'mean_word_length': 5.54978354978355, '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}}
Stability Analysis of Cooperating Congestion Control Algorithm

With the network architecture more and more complex, it is an interesting problem how to cooperate many routers working in the multilayer network simultaneously. Since these AQM (Active Queue Management) algorithms based on the single router have not considered the link capacity of connected routers, there are some disadvantages, e.g., it is difficult to deal with the congestion problem effectively only according to a single edge router’s information. In this paper, we analyze the stability of the congestion control algorithm with cooperation between edge and core routers by setting the available AQM parameters, and reveal the reasons that the cooperating congestion control can effectively control congestion by the model. The proposed theorems consider the stability of the AQM network under many data flows, which ensures that there is no congestion in the largely higher network without additional control block. The proposed stability analysis theory is based on the classical Random Early Detection (RED) and is considered from the aspect of virtual node. Finally, according to the algorithm and stability analysis, we give the dynamic simulation results of experiment about the TCP window size, instantaneous queue length, the dropping probability and the throughput. This paper describes the detrimental consequences of oscillatory or chaotic behavior based on the stability theorem for the cooperating congestion control algorithm.