Routing Lookup Algorithm Performance Analysis and Research
This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.
Qi Luo and Yuanzhi Wang
X. M. Wei "Routing Lookup Algorithm Performance Analysis and Research", Advanced Materials Research, Vols. 181-182, pp. 109-112, 2011