Internet protocol (IP) lookup is a key technology that affects network performance. Numerous studies have inves- tigated IP lookup and provided solutions for improving lookup algorithms. Herein, we utilized various state-of-the-art algorithms for improving IP lookup performance and explore trie-based algorithms to understand how these algorithms affect memory access or usage and the resulting reductions in IP lookup times. Moreover, we utizsed parallel data processing for increasing IP lookup throughput. These algorithms are applicable to all tries. Nevertheless, we conducted experiments by using only binary tries for simplicity. IP lookup algorithms were tested through simulations using real IPv4 router tables with 855,997 or 876,489 active prefixes. Finally, a synthetic architecture combining all of the discussed algorithms was proposed and evaluated.
更多
查看译文
关键词
Internet computing,Router table design,IPv4,Trie-based algorithms,Direct lookup tables,Next-hop tables,Data communication