{'fraction_non_alphanumeric': 0.009963768115942028, 'fraction_numerical': 0.0, 'mean_word_length': 5.424418604651163, '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}}
On some sufficient conditions for distributed QoS support in wireless networks

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth Quality of Service (QoS) requirements can be satisfied. We are especially interested in distributed implementations which have low communication overhead and low processing complexity. Row constraints are known to be sufficient, and we introduce the notion of the induced star number of a graph and show that this quantity determines the performance of this condition. We further investigate this problem for some special classes of networks and interference models such as unit disk networks and primary interference constraints. We determine the exact worst-case performance of some distributed algorithms for admission control and thereby show that they can be arbitrarily far away from optimal; we then show that these algorithms are within a bounded factor away from optimal for some well known classes of networks and interference models.