{'fraction_non_alphanumeric': 0.018867924528301886, 'fraction_numerical': 0.0, 'mean_word_length': 4.552238805970149, '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}}
Stationary and stability of fork-join networks

We consider a fork-join network with arrival and service times forming a stationary and ergodic process. The usual stability condition, namely that the input rate is strictly less than all the service rates, is proved to be valid in this general case. Finally we extend the result to the case where there is random routing.