1 ART Working Group
1.1 Introduction
1.2 Radix
1.2.1 Radix tree structure
1.2.2 Radix lookup algorithm
1.2.3 Examples of Radix lookup
1.2.4 Difficulty of Radix
1.3 Radish
1.3.1 The longest initial substring
1.3.2 Radish routing table
1.3.3 Examples of Radish lookup
1.3.4 Tree construction
1.3.5 Lookup Strategies and Evaluation
1.3.6 Forward search
1.3.7 Skipping forward search
1.3.8 Skipping backward search
1.4 Implementation Status
1.5 Conclusion
戻る