{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0010141987829614604, 'mean_word_length': 5.2075471698113205, '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}}
Tight bounds for sketches in traffic validation

Forwarding fault detection increases the robustness of network connectivity by finding and allowing to react to faulty routers. One of the essential steps in forwarding fault detection is summarizing the observed traffic at different vantage points, so that the behavior of each monitored router can be assessed using a traffic validation function. This paper studies and characterizes 3 sketches (AGMS, Fast-AGMS and FastCount) as random variables in the given context. Sketches are traffic summary functions resilient to packet modification, creation and dropping that outperform sampling. By proposing a model for each sketch, we are able to define tighter bounds on the sketches' precision. That means we can choose smaller sketches, around one order of magnitude or more for given requirements on the precision the sketch, typically in the range of tens of KB, saving memory and network bandwidth in the detection of faulty routers.