Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2001.06a
- /
- Pages.261-264
- /
- 2001
An Optimized Address Lookup Method in the Multi-way Search Tree
멀티웨이 트리에서의 최적화된 어드레스 룩업 방법
Abstract
This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.
Keywords