{'fraction_non_alphanumeric': 0.011099899091826439, 'fraction_numerical': 0.0, 'mean_word_length': 5.483660130718954, '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 approach using node operating point for performance analysis with network calculus

The operating point of a node is an interesting concept from large deviations theory which defines the asymptotic buffer occupancy distribution at the node. This paper uses the notion of operating point within the framework of statistical network calculus to perform network analysis. Effective bandwidth is the key concept connecting the notion of node operating point with the theory of statistical network calculus. The use of effective bandwidth function to derive performance bounds in statistical network calculus provides insight into the queue dynamics. The two main contributions of this paper are: (i) we derive tight performance bounds using the effective bandwidth function within the framework of statistical network calculus, and (ii) we substantiate that the asymptotic buffer occupancy distribution can be a valid bound for the steady state buffer occupancy distribution at a single node.