{'fraction_non_alphanumeric': 0.02454642475987193, 'fraction_numerical': 0.0, 'mean_word_length': 5.090909090909091, '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}}
Fault-tolerant table generating algorithm: further work on MNLIRS routing scheme

In networks of clusters, a collection of computing nodes works in concert to solve large application problems. The nodes exchange messages and coordinate their efforts by sending and receiving messages through a routing network. Consequently the achieved performance of such machines depends critically on that of their routing networks. Commonly there is a routing table at each node of the network. When a message is to be sent, the routing table is consulted for the direction. Multi-node label interval routing scheme (MNLIRS) is a routing framework which provides a compressed routing table for efficient routing with fault-tolerance. In the scheme, fault-tolerant tables can be introduced to improve the capability of end-to-end fault-tolerant delivery. In this paper, the algorithms to generate the fault-tolerant table are presented and evaluated.