Routing Lookup Algorithm Performance Analysis and Research
2011 ◽
Vol 181-182
◽
pp. 109-112
Keyword(s):
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.
Keyword(s):
2020 ◽
Vol 16
(1)
◽
pp. 1-8
◽
Keyword(s):
2020 ◽
Vol 39
(9)
◽
pp. 4695-4704
Keyword(s):
Keyword(s):
2020 ◽
Vol 69
(5)
◽
pp. 4968-4978
◽
Keyword(s):
2019 ◽
Vol 2019
(1)
◽