{'fraction_non_alphanumeric': 0.0125, 'fraction_numerical': 0.0, 'mean_word_length': 5.582191780821918, '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}}
Routing tables as big data searchable structures for achieving real-time session fault tolerant rerouting

In this paper the networked routers decision support tables are presented as big data structures. Routing tables ease the modeling of interconnected networks traffic and update costs, and have grown in size presenting a multitude of possibilities for communication infrastructures. The created complexity has reached a volume of processing that tends to be efficiently administered with new protocols development, but for real-time session transmissions it still lacks fault tolerance aspects. The contribution of this article proposes a solution through which existent resources of networking equipment can be used to implement fault tolerance, making an effective use of the vast searchable environment. This solution comes from the view of the real-time session persistent routing problem, a context analyzed in depth with its interacting components.