{'fraction_non_alphanumeric': 0.022151898734177215, 'fraction_numerical': 0.0, 'mean_word_length': 4.754545454545455, '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}}
Counter-Examples to the Optimality of MWS-α Policies for Scheduling in Generalized Switches

It has been conjectured that MWS-α scheduling policies with α going to zero are heavy-traffic optimal for scheduling in a generalized switch when the objective is to minimize the number of backlogged packets in the system. We examine this conjecture by first deriving optimal or heavy-traffic optimal policies for small switches and then comparing them to MWS-α policies. Our conclusion is that the conjecture is not true in general, i.e., there are simple topologies for which there exist policies which outperform MWS-α in heavy traffic.