{'fraction_non_alphanumeric': 0.01437699680511182, 'fraction_numerical': 0.0, 'mean_word_length': 5.296482412060302, '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}}
Distributed Path Selection for Storage Networks

In the last couple of years a dramatic growth of data storage capacity can be observed. To manage the explosion of data, a common approach is to combine storage devices into a dedicated network, called storage area network. One of the major requirements for these networks is scalability. Existing concepts often lack scalability either because they are based on central components, or because the routing cannot handle large or irregular topologies efficiently. In a project at the Paderborn University, we are currently developing concepts for storage area networks ensuring that every function is performed in a completely distributed way. In this paper, we concentrate on our routing concepts. We present a completely distributed path selection algorithm called DPS that is applicable to arbitrary network topologies. Surprisingly, this algorithm does not need any information about the topology of the network and, although very simple, is able to compute paths that provably reach a best possible distribution of paths among the links. To demonstrate the applicability of our algorithm, we compare its performance with several other approaches for standard networks such as meshes and butterflies.