Fast Packet Classification Using Bloom filters快速分组分类用开滤波器.pptVIP

HEXA: Compact Data Structuresor Faster Packet Processing Author: Sailesh Kumar, Jonathan Turner, Patrick Crowley, Michael Mitzenmacher. Publisher: ICNP 2007 Presenter: Yu-Ping Chiang Date: 2009/02/10 Outline HEXA (History-based Encoding, eXecution and Addressing) Main idea example One-to-one mapping Update method bHEXA (Bounded HEXA ) Main idea example Experimental Evaluation HEXA - Main idea example Standard representation: Assume next hop information stored in shadow trie. Fast memory consumption in this example: 1(prefix flag) + 4(left child id) + 4(right child id) = 9 bits/node HE