{'fraction_non_alphanumeric': 0.030009680542110357, 'fraction_numerical': 0.0, 'mean_word_length': 5.382716049382716, '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}}
Fair end‐to‐end window‐based congestion control in time‐varying data communication networks

Communication networks are time varying and, hence, fair sharing of network resources among the users in such a dynamic environment is a challenging task. In this context, a time‐varying network model is designed, and the shortest user's route is found. In the designed network model, an end‐to‐end window‐based congestion control scheme is developed with the help of internal nodes or router, and the end user can get implicit feedback (throughput). This scheme is considered as fair if the allocation of resources among users minimizes overall congestion or backlog in the networks. Window update approach is based on a multi‐class fluid model and is updated dynamically by considering delays (communication, propagation, and queuing) and the backlog of packets in the user's routes. Convergence and stability of the window size are obtained using a Lyapunov function. A comparative study with other window‐based methods is also provided.