Applications of the theory of random graphs to average algorithm performance analysis

1979 ◽  
Author(s):  
Henry K. DeWitt
Keyword(s):  
Performance Analysis ◽  
Random Graphs ◽  
Algorithm Performance

Routing Lookup Algorithm Performance Analysis and Research

2011 ◽  
Vol 181-182 ◽  
pp. 109-112
Author(s):  
Xian Min Wei
Keyword(s):  
Performance Analysis ◽  
Search Algorithm ◽  
Binary Search ◽  
Algorithm Performance ◽  
Practical Performance ◽  
Binary Search Algorithm ◽  
Routing Lookup ◽  
Searching Performance

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.

Sign in / Sign up

Export Citation Format

Share Document