{'fraction_non_alphanumeric': 0.017006802721088437, 'fraction_numerical': 0.0011337868480725624, 'mean_word_length': 4.966216216216216, '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}}
An Algorithm for Acquiring Reliable Path in Abnormal Traffic Condition

Most Reliable Paths algorithm make it enable to select the most stable path on network by considering not only link cost but also link capacity, link operation probability and the size of message to be sent. But this algorithm uses a fixed value as link operation probability so that it can be applicable in the normal network state, not in the network state that traffic abnormally increase. To solve this problem, this thesis applies the packet drop probability of RED (Random Early Detection) method to the operation probability of the most reliable path algorithm so that the most reliable path can be guaranteed. For this purpose, we propose an All-Pairs Most Reliable Paths acquiring algorithm having time complexity thetas (n3) based on the All-Pairs Shortest Paths algorithm proposed by Floyd-Warshall.