The growth of the Internet in recent years has led to an enormous increase of the number of routing table entries. Address
tables in IP routers require efficient and compact implementation to allow fast lookup of IP addresses. One solution for fast address lookup in software is to use the LC-trie data stucture. The search depth for the LC-trie increases slowly as function of the number of entries. This master thesis discusses the
performance of the fast address lookup in the LC-trie algorithm. The main focus of this master thesis is to use the
instruction set simulator, SimICS for performance evaluation of the address lookup in the LC-trie algorithm. The address lookup is performed for 100000 addresses in a LC-trie. The results are measured in terms of number of memory accesses and number of executed instruction per address lookup.