1 Greedy Prefix Cache for IP Routing Lookups Author: Zhuo Huang, Gang Liu, Jih-Kwon Peir Publisher: I-SPAN 2009 Presenter: Hsin-Mao Chen Date:2010/03/10

2 Outline Introduction Minimal Expansion Prefix Motivation For Caching Parent Prefix Greedy Cache With Prefix Upgrade Performance Evaluation

3 Introduction 0100

4 Minimal Expansion Prefix Suppose the deepest that the key can traverse in the trie is i bits and the last remembered prefix node is a parent P. If the resulting i+1 bit prefix is the shortest disjoint child of the matching parent that also matches the given key. It can be used to partially represent P.

5 Minimal Expansion Prefix

6 Motivation For Caching Parent Prefix Trace from MAWI[18] and the as1221 routing table[3]

7 Motivation For Caching Parent Prefix The results indicate that caching the parent prefix is much more efficient than caching the MEPs since it requires several MEPs to cover a parent prefix.

8 Greedy Cache With Prefix Upgrade Instead of the MEP, the parent prefix can be cached when all the children prefixes are also present in the cache.

9 Greedy Cache With Prefix Upgrade 0101… 011… 0100…

10 Greedy Cache With Prefix Upgrade The prefix upgrade mechanism may not always upgrade an existing MEP to a parent prefix if the parent has more than one child.

11 Greedy Cache With Prefix Upgrade … ： …

12 Performance Evaluation MAWI[18] and the as1221 routing table[3]

13 Performance Evaluation Fully-associative

14 Performance Evaluation

15 Motivation For Caching Parent Prefix