{'fraction_non_alphanumeric': 0.022244691607684528, 'fraction_numerical': 0.0020222446916076846, 'mean_word_length': 5.305732484076433, '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}}
Scaling of buffer and capacity requirements of voice traffic in packet networks

The migration of voice communication from the Public Switched Telephone Network to the Internet pushes the need to adequately size network resources such as buffers and capacity. This paper addresses the problem of how these resources should be scaled in the number of voice flows N in order to guarantee predefined packet loss probabilities and end-to-end delays. By deriving non-asymptotic buffer overflow probabilities at both edge and interior network nodes, the paper demonstrates that O(1) buffers are sufficient to ensure probabilistic packet loss constraints at all utilizations. Also, by deriving end-to-end delay bounds, the paper shows that the required per-flow capacities are bounded by O (1÷N) when probabilistic end-to-end delay guarantees are sought. Numerical examples illustrate that statistical multiplexing dominates the effect of scheduling in multi-nodes scenarios with high capacities.