{'fraction_non_alphanumeric': 0.02546916890080429, 'fraction_numerical': 0.004021447721179625, 'mean_word_length': 5.610619469026549, '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 and stability of a distributed CSMA algorithm for maximal network throughput

Designing efficient scheduling algorithms is an important problem in a general class of networks with resource-sharing constraints, such as wireless networks and stochastic processing networks [7]. In [5], we proposed a distributed scheduling algorithm that can achieve the maximal throughput in such networks under certain conditions. This algorithm was inspired by CSMA (Carrier Sense Multiple Access). In this paper, we prove the convergence and stability of the algorithm, with properly-chosen step sizes and update intervals. Convergence of the joint scheduling and congestion control algorithm for utility maximization in [5] can be proved similarly.