{'fraction_non_alphanumeric': 0.011093502377179081, 'fraction_numerical': 0.0, 'mean_word_length': 5.723404255319149, '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}}
Performance analysis of tandem queues with small buffers

An approximation for the performance analysis of single-server tandem queues with small buffers and generally distributed service times is presented. The approximation is based on the decomposition of the tandem queue into subsystems, the parameters of which are determined by an iterative algorithm. By employing a detailed description of the service process of each subsystem, it proved possible to obtain an accurate approximation of performance characteristics such as throughput and mean sojourn time. The proposed technique significantly outperforms existing methods.