{'fraction_non_alphanumeric': 0.011538461538461539, 'fraction_numerical': 0.005128205128205128, 'mean_word_length': 5.349593495934959, '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}}
Mathematical analysis of network traffic

The level of complexity in computer networks is rising and the mathematics needed to model the network traffic behaviour is not an exact science. This paper aims to bridge the gap between mathematics and engineering by illustrating some of the problems that exist with conventional traffic modeling, and show how to obtain informative network statistics via mathematical tools such as the Hurst (1951) parameter and the autocorrelation function. We show how aggregated traffic behaves over various time scales and focus on certain protocols to observe their impact on the network at various ingress/egress points on our university network. Furthermore, we present the many analytical tools that are useful in characterising these systems.