Routing Lookup Algorithm Performance Analysis and Research

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 181-182)

Edited by:

Qi Luo and Yuanzhi Wang

Pages:

109-112

DOI:

10.4028/www.scientific.net/AMR.181-182.109

Citation:

X. M. Wei "Routing Lookup Algorithm Performance Analysis and Research", Advanced Materials Research, Vols. 181-182, pp. 109-112, 2011

Online since:

January 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.