{'fraction_non_alphanumeric': 0.026604068857589983, 'fraction_numerical': 0.0, 'mean_word_length': 5.597938144329897, '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}}
Convergence-speed enhancement of two classes of (Ω,α)-fair rate allocation algorithms

In the current paper, a fast second-order rate allocation algorithm is proposed that can improve the convergence speed of conventional methods. Under certain (and almost) practical premises about the network topology, an end-to-end implementation of well-known proportional and minimum potential delay fair rate allocation algorithms is introduced. The proposed algorithm has been compared with the conventional method and TCP using simulation. The simulation results show that the proposed method outperforms the conventional ones in convergence rate.