{'fraction_non_alphanumeric': 0.025826446280991736, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
A Comparative Study of One-to-many Wdm Lightwave Networks

Most of the proposed architectures for interconnecting parallel systems are based on graph topologies. However, these point-to-point topologies have severe drawbacks concerning physical implementation and use, as far as high bit rate networks are concerned. Recently, one-to-many topologies based on the hypergraph theory have emerged. They take advantage of the wavelength division multiplexing (WDM) technology that allows the huge bandwidth of optical ber to be divided into several high-speed channels, where one such channel can be seen as a logical attribute shared among many processors. In this paper, we compare these hypergraph{based WDM lightwave networks in terms of simulated packet delivery time, average number of hops, link utilization, and throughput. We conclude that the hypertorus and the stack-torus are very good candidates for implementing lightwave networks in future parallel systems.