{'fraction_non_alphanumeric': 0.012403100775193798, 'fraction_numerical': 0.0015503875968992248, 'mean_word_length': 5.333333333333333, '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}}
Research of higher order Chord routing algorithm

In Chord protocol of P2P network, distances between entries in routing table are too long and only half of the identifier space can be covered. To solve this problem, a higher order Chord routing algorithm is proposed. The algorithm presents a new structure formula for routing table, increases distribution density of routing table entries, and extends routing searching coverage areas to the entire identifier space. Theory analysis shows that improved algorithm reduces the average lookup path length and the final experiment result also proves that location efficiency is promoted obviously.