{'fraction_non_alphanumeric': 0.013320647002854425, 'fraction_numerical': 0.0, 'mean_word_length': 5.08092485549133, '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 Unified Approach to Scan Time Analysis of Token Rings and Polling Networks.

Token rings and multipoint polled lines are two widely used network interconnection techniques. The general concept of cyclic allocation processes is defined and used to characterize token passing and polling in these networks. Scan time, the time to poll all nodes at least once, is an important quantity in the response time analysis of such networks. We derive expressions for the mean and variance of scan times using a direct, operational approach. Resulting expressions are general and are applicable to both exhaustive and non-exhaustive service. The effect of higher level protocols is easily incorporated in the analysis via calculations of constituent quantities. The expression for mean scan time is exact and depends only on the means of message transmission times and arrival rates. The approximate analysis of variance takes into account the correlation between message transmissions at different nodes. Expected level of accuracy is indicated by an example.