{'fraction_non_alphanumeric': 0.016597510373443983, 'fraction_numerical': 0.0013831258644536654, 'mean_word_length': 5.350877192982456, '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}}
An accurate model for the performance analysis of deterministic wormhole routing

Presents a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furnishes a closed formula for the average message delay in wormhole deterministic routing. In this paper, the focus is on 3D asymmetric torus networks with uni-directional or bi-directional links. However, the model can be easily applied to evaluate the performance of deterministic wormhole policies in any hypercube and torus topology. The comparison with two simulation models demonstrates that our methodology gives accurate results for both low and high traffics.