{'fraction_non_alphanumeric': 0.015055467511885896, 'fraction_numerical': 0.000792393026941363, 'mean_word_length': 5.221674876847291, '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}}
TEAPC: Time Efficient Algorithm for multidimensional Packet Classification

The state of network routing today is the result of theoretical progress, technological advances and operational experiences. It is also impacted by economic and policy issues. The packet information search at router is really complicated task and hence, packet classification is often a performance bottleneck in network infrastructure; therefore, it has received much attention in the research community. In general, there have been two major threads of research addressing this problem: algorithmic and architecture.. The novel scheme considers the IPV4 packet header structure. The proposed approach extract IP addresses, portal addresses and protocol field from header part and match them with the rule in the classifier. The rules are arranged such that each fields are divided into two equal parts and stored in a static data structure. A binary search tree is generated if the algorithm encounters the same rule. It is important to note that the uniqueness of the rule is judged by the source and destination address rule. The proposed scheme significantly reduces the processing time by simplification of the heuristics used in static allocation of array as its data structure.