{'fraction_non_alphanumeric': 0.026243093922651933, 'fraction_numerical': 0.012430939226519336, 'mean_word_length': 5.041666666666667, '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}}
Performance enhancement of IP forwarding by reducing routing table construction time

In previous work, Lampson et al. (1999) proposed an IP lookup algorithm which performs binary searches on prefixes (BSP). The algorithm is attractive for IPv6 because of its bounded worst-case memory requirement. Although for the sake of fast forwarding, the cost paid for the slowing down insertion is reasonable, the performance of routing-table reconstruction in BGP is too time-consuming to handle the frequent route updates. In this letter, we propose a fast forwarding-table construction algorithm which can handle more than 3600 route updates per second. Moreover, it is simple enough to fulfill the need of fast packet forwarding.