Enhanced Patricia Tree with Reordering and Fast Incremental and Decremental Update Functions

Authors

  • Shin-ichi Ishida, Koji Ikehara, and Hiroaki Nishi Author

Keywords:

Enhanced patricia tree with reordering, internet router, routing lookup.

Abstract

Routing-table lookup function is formed as a tree 
structure. In particular, backbone router of the Internet 
manages a huge tree structure of the routing table in order to store all routing information brought by routing protocols, such as BGP. Though high-speed lookup is desirable for the backbone router, the tree-based lookup requires multiple memory accesses and it degrades the throughput of the lookup. Aggregation of redundant nodes and elimination of useless nodes are necessary for the high-throughput lookup. Enhanced 
Patricia Tree (EPT) and Enhanced Patricia Tree with 
Reordering (EPT-R) were studied for the high-throughput lookup. In this paper, the incremental and decremental update algorithms for EPT-R are proposed and evaluated. These incremental and decremental update algorithms for EPT and EPT-R are effective in quick update time. 

Downloads

Download data is not yet available.

Downloads

Published

06.07.2012

How to Cite

Enhanced Patricia Tree with Reordering and Fast Incremental and Decremental Update Functions . (2012). International Journal of Information and Electronics Engineering, 2(5), 656-660. https://www.ijiee.org/index.php/ijiee/article/view/196