{'fraction_non_alphanumeric': 0.03465003465003465, 'fraction_numerical': 0.001386001386001386, 'mean_word_length': 4.869918699186992, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 3, '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}}
Queueing analysis of high-speed multiplexers including long-range dependent arrival processes

With the advent of high-speed networks, a single link will carry hundreds or even thousands of applications. This results in a very natural application of the central limit theorem, to model the network traffic by a Gaussian stochastic processes. We study the tail probability P({Q>x}) of a queueing system when the input process is assumed to be a very general class of Gaussian processes which includes a large class of self similar or other types of long-range dependent Gaussian processes. For example, past work on fractional Brownian motion, and variations therein, are but a small subset of the work presented in this paper. This study is based on extreme value theory and we show that log P({Q>x})+m/sub x//2 grows at most on the order of logx, where m/sub x/ corresponds to the reciprocal of the maximum (normalized) variance of a Gaussian process directly related to the aggregate input process. The result is considerably stronger than the existing results in the literature based on large deviation theory, and we theoretically show that this improvement can be quite important in characterizing the asymptotic behavior of P({Q>x}). Through numerical examples, we also demonstrate that exp[-m/sub x//2] provides a very accurate estimate for a variety of long-range and short-range dependent input processes over the entire buffer range.