Abstract: Internet network is comprised of routers that forward packets towards their destinations. IP routing lookup requires computing the Best-Matching Prefix. The main Functionality of Router is finding the Appropriate Path for Packet. There are many Algorithms for IP-Lookup with different Speed, Complexity and Memory usage. In This Paper Three Binary Trie algorithms will be considered for Performance Analysis. These algorithms are Priority-Trie, Disjoint Binary and Binary Trie. We consider three parameters for comparison, these parameters are Time, Memory and Complexity of Algorithms. For performance analysis, we develop and run algorithms with real Lookup-Tables which were used in an edge router

Alireza Shirmarz, Masoud Sabaei and Mojtaba hosseini, “Evaluation and Comparison of Binary Trie base IP Lookup Algorithms with Real Edge Router IP Prefix Dataset” International Journal of Advanced Computer Science and Applications(IJACSA), 7(6), 2016. http://dx.doi.org/10.14569/IJACSA.2016.070620

@article{Shirmarz2016,
title = {Evaluation and Comparison of Binary Trie base IP Lookup Algorithms with Real Edge Router IP Prefix Dataset},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.070620},
url = {http://dx.doi.org/10.14569/IJACSA.2016.070620},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {6},
author = {Alireza Shirmarz and Masoud Sabaei and Mojtaba hosseini}
}