Performance analysis of the IP lookup table updating

Routing of packets based on their global IP addresses is one of the toughest tasks on the Internet, especially as the number of hosts keeps growing. Various IP lookup algorithms were designed to achieve high speeds and low memory requirements. Improvement of the IP lookup algorithms usually comes at the expense of a more complex algorithm for updating of the lookup tables. Algorithms for updating the lookup tables using the control plane protocols were neither implemented nor sufficiently analyzed in the literature. In this paper, we propose and implement the update algorithm for one classical lookup table according to the network topology changes reported by the OSPF protocol. Then, we will analyze the performance of the described algorithm in a real network environment.