{'fraction_non_alphanumeric': 0.00995732574679943, 'fraction_numerical': 0.0, 'mean_word_length': 4.866666666666666, '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}}
APPROXIMATE SOLUTION OF A CLASS OF QUEUEING NETWORKS WITH BREAKDOWNS

In this paper we study a class of open queueing network where servers suffer breakdowns and are subsequently repaired. The network topology is a pipeline with feedback from the final node to the first. Each node consists of a number of queues each with an unreliable server. There are no losses from the queues in this system, however jobs are routed according to the distribution of operational servers at each node in the pipeline. This model is in general intractable, however an iterative technique is presented which combines a number of earlier results to generate an approximation to steady state measures found by simulation.