{'fraction_non_alphanumeric': 0.016379310344827588, 'fraction_numerical': 0.0, 'mean_word_length': 5.275675675675676, '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}}
Application of transient queueing theory in Internet traffic

The fast evolution of Internet technology (the net of nets) as well as the design and deployment of a large number of computer-based applications impose improvements in the efficiency of network traffic management. Rapid development of telecommunication technologies and the ever growing network users’ demands have made network congestion a prominent problem in today’s Internet. One of the most important performance measures of a data network is the available bandwidth of Internet path from origin to destination. We measure the available bandwidth by means of packet delay. Queueing theory is the primary methodological framework for analyzing network delay. In the literature of queueing theory, most of the results are obtained by stationary analysis on queueing systems in the steady-state. Usually, practical queueing systems are operated over a finite-time horizon; their performance depends on the system time and initial conditions. Small distance between packets makes the short time behavior of the traffic to be of most importance. This is related to the transient queueing analysis.