Neural Packet Classification
Eric Liang, Hang Zhu, Xin Jin, Ion Stoica

TL;DR
This paper introduces NeuroCuts, a deep reinforcement learning approach for packet classification that automatically generates optimized decision trees, outperforming traditional heuristics in speed and memory efficiency.
Contribution
The paper presents NeuroCuts, a novel deep RL method that automates decision tree construction for packet classification, surpassing hand-tuned heuristics in efficiency.
Findings
NeuroCuts improves classification time by 18% median over existing algorithms.
Reduces memory footprint and classification time by up to 3x.
Efficiently explores decision trees using deep RL to optimize global objectives.
Abstract
Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularly challenging. To navigate this tradeoff, existing solutions rely on complex hand-tuned heuristics, which are brittle and hard to optimize. In this paper, we propose a deep reinforcement learning (RL) approach to solve the packet classification problem. There are several characteristics that make this problem a good fit for Deep RL. First, many of the existing solutions are iteratively building a decision tree by splitting nodes in the tree. Second, the effects of these actions (e.g., splitting nodes) can only be evaluated once we are done with building the tree. These two characteristics are naturally captured by the ability of RL to take actions that have sparse and delayed rewards. Third, it is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Network Security and Intrusion Detection · Protein Degradation and Inhibitors
