{'fraction_non_alphanumeric': 0.027906976744186046, 'fraction_numerical': 0.002325581395348837, 'mean_word_length': 4.130952380952381, '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}}
Capacity of loss-free queue with QoS constraints

In this paper, we propose a method to analyze the capacity of a network node. The concept of channel capacity in Shannon information theory is used. We focus on the single node case, with loss-free queue. Also, the QoS constraints of the traffic are taken into account during our analysis. The capacity of a M/M/1 queue is given in this paper with the constraints of packet delay.