1. 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

2. 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

3. *Prefix tree 3 Insert : 1*

4. Prefix tree deletion operation 4

5. CMST 5

6. 6

7. CMST Insert 7 Insert : ( 00100*, Q )

8. CMST Insert 8 Insert : ( 0011*, R )

9. CMST Insert 9 Insert : ( 0010011*, S )

10. CMST Insert 10 Insert : ( 001101*, T )

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

12. CMST Lookup 12 Search : 00100011*Port : Default portBAO

13. CMST Delete 13 Delete : 0010010* Delete

14. PCMST 14

15. K-CMST & K-PCMST 15

16. Experimental Result 16

17. 17