{'fraction_non_alphanumeric': 0.028265107212475632, 'fraction_numerical': 0.0009746588693957114, 'mean_word_length': 5.076923076923077, '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}}
Compressed sensing based network tomography using end-to-end path measurements

Network tomography can help detect network link delay. End-to-end path measurement is a promising method in network tomography which could reduce measurement overhead. In end-to-end path measurement, however, deriving link states is computational complex due to the existence of massive links. Because only a few links are congested at the same time, we can locate sparsely congested links by using compressed sensing (CS). In this paper, based on expander graphs, we demonstrate that routing matrix constructed by full tree network can satisfy Restricted Isometry Property (RIP) and be used as measurement matrix. Finally, sparsely congested links are given with CS. Evaluation results show that routing matrix constructed in this paper can help achieve high link delay recovery accuracy, i.e., small recovery error by using 1i-minimization in CS. It also illustrate that the recovery error decreases with the number of congested links decrease.