{'fraction_non_alphanumeric': 0.02040816326530612, 'fraction_numerical': 0.0022675736961451248, 'mean_word_length': 4.51875, '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}}
Segregating the Input to a Series of Buffers

Messages are to be transmitted through a series of n nodes linked by communication channels. The lengths of messages are independent identically distributed random variables, and the time taken to transmit a message through a channel is equal to the message's length. Each node has a finite buffer, and when the number of messages at a node reaches the buffer size transmission from the preceding node is interrupted. This paper is concerned with the extent to which the throughput of such a system can be improved by segregating long messages. It is shown, for example, that by using two series in parallel, one dealing with long messages and the other dealing with the rest, the decay of throughput with series length can be improved from (log n ) -1 to (log log n ) -1 in the case where message lengths are exponentially distributed.