A fast IPv6 route lookup algorithm with hash compression

摘要

To solve the problem of the LLCAT algorithm (P.A. Yilmaz et al., IEEE GLOBECOM'00, vol.1, p.593-8, 2000) that needs large memory space for IPv6 route lookup, the paper proposes a fast IPv6 route lookup algorithm with hash compression. In order to save space, hash compression is used when a node's table includes some prefixes that are less than or equal to a predefined value. After being compressed, the algorithm's time and update complexity do not change much under the worst condition. Simulation results show that our average lookup time and memory consumed are all efficient compared to those of the LLCAT algorithm.