{'fraction_non_alphanumeric': 0.019011406844106463, 'fraction_numerical': 0.0076045627376425855, 'mean_word_length': 4.851851851851852, '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}}
Design of 2-level hierarchical ring networks

Hierarchical Ring Networks are widely used in communication systems, logistics and shared multiprocessors. It is hence imperative that efficient design of these structures has to be carried out, to reduce costs of their installation and help increase the ease of management. In this paper, we look at the problem of designing efficient 2-level Hierarchical Ring Networks, in the context of link costs optimization. 2-level HRNs only have two kinds of rings — local rings to connect disjoint sets of nodes and a global ring to interconnect all the local rings. We present an algorithm that is based on Simulated Annealing. We present results for scenarios containing upto 300 nodes. The results obtained from the algorithm are most encouraging.