{'fraction_non_alphanumeric': 0.019438444924406047, 'fraction_numerical': 0.0, 'mean_word_length': 4.9423076923076925, '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}}
Effects of symmetry on Braess-like paradoxes in distributed computer systems-a numerical study

Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have already been reported. Unlike the original Braess paradox, this behavior occurs only in the case of finitely many users and not in the case of infinite number of users in the models examined. This study examines a number of numerical examples around the Braess-like paradox such as above. The numerical examples suggest that the Braess-like paradox is stronger, i.e., the performance degradation of all users in the Brass-like paradox is larger when the system has a higher degree of symmetry and, in particular, is strongest in the completely symmetrical system whereby the parameter values describing each user are identical, which is against our previous intuition.