A Classified Multi-Suffix Trie for IP Lookup and Update Author: Sun-Yuan Hsieh, Ying-Chi Yang Publisher: IEEE TC Presenter: Jia-Wei Yo Date: 2011/10/12 1

Introduction Propose a trie-based data structure called Classified Multi- Suffix Trie (CMST) for designing dynamic router-tables. Each node can store more than one prefix and can return the longest matching prefix immediately when it is found in some internal node. Also propose a data structure called the Partitioning Classified Multi-Suffix Trie (PCMST) to reduce the height of a trie and expedite router-table operations. Two proposed data structures can be applied to both IPv4 and IPv6 routing databases. 2

*Prefix tree 3 Insert : 1*

Prefix tree deletion operation 4

CMST 5

6

CMST Insert 7 Insert : ( 00100*, Q )

CMST Insert 8 Insert : ( 0011*, R )

CMST Insert 9 Insert : ( *, S )

CMST Insert 10 Insert : ( *, T )

CMST Insert 11 => Insert : ( 111*, I )Insert : ( *, T )

CMST Lookup 12 Search : *Port : Default portBAO

CMST Delete 13 Delete : * Delete

PCMST 14

K-CMST & K-PCMST 15

Experimental Result 16

17