{'fraction_non_alphanumeric': 0.04328018223234624, 'fraction_numerical': 0.00683371298405467, 'mean_word_length': 5.659090909090909, '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}}
CS 268 Project Proposal : Packet Classification Using Explicit Coordination

Packet classification is the key building block of many network services and functionalities (e.g., switching, forwarding, filtering, load balancing, policy-based routing and, QoS) in different layers [2]. In each case, a classifier determines which flow an arrived packet belongs to and takes action based on some given rules. However, high speed packet classification, in presence of arbitrarily large number of classification rules, is known to be computation-intensive, power hungry, and consequently, expensive [1]. Despite its prevalence, packet classification is implemented and deployed in an ad-hoc manner at different layers of the protocol stack [2]. This leads to (i) high implementation and configuration complexity, and (ii) difficulties in accurately capturing classification semantics.