Hierarchical Priority Trie for Efficient Packet Classification

효율적인 패킷 분류를 위한 계층 우선순위 트라이

In order to provide value-added services, next generation routers should perform packet classification for each incoming packet at wire-speed. In this paper, we proposed hierarchical priority trio (Hptrie) for packet classification. The proposed scheme improves the search performance and the memory requirement by replacing empty internal nodes in ordinary hierarchical trio with priority nodes which are the nodes including the highest priority rule among sub-trie nodes.