{'fraction_non_alphanumeric': 0.016415868673050615, 'fraction_numerical': 0.0, 'mean_word_length': 4.856, '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}}
Modeling of the hotspot load traffic for crossbar switch node by means of Generalized Nets

The apparatus of Generalized Nets is applied here to describe a PIM-algorithm for computing a non-conflict schedule for packet switch node. In the present paper we propose a family of patterns for nonuniform traffic simulation based on the hotspot traffic model. The results from computer simulations of the throughput on a switch node with these patterns are presented. The necessary computations have been performed on grid-clusters of CERN. Our simulations utilize the PIM-algorithm, specified by apparatus of Generalized Nets. It is shown that there is an upper bound on the throughput of PIM-algorithm for proposed family of patterns.