{'fraction_non_alphanumeric': 0.021379980563654033, 'fraction_numerical': 0.0, 'mean_word_length': 5.518987341772152, '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}}
Design of Congestion Control Based on Instantaneous Queue Sizes in the Routers

Recently, eXplicit Control Protocol (XCP), Rate Control Protocol (RCP), and Adaptive Proportional-Integral Rate Control Protocol (API-RCP) have been proposed for congestion control, with the main objective of achieving fair and maximum bandwidth utilization. However, studies reveal that both RCP and XCP may suffer continuous oscillations due to misestimating the bottleneck link capacity, and API-RCP may experience oscillations because of its PI adaptivity scheme which involves switching nonlinearity. To avoid these problems, in this paper a way of designing congestion control based on the instantaneous queue sizes in the routers is proposed. The new scheme attains high link utilization and smooth dynamics by clamping the bottleneck queue at a desired size. And it maintains good fairness by allocating the bottleneck bandwidth equally to the competing flows. Simulations are performed to verify the effectiveness of the theoretical design.