基于压缩NH表的高速IP路由查找算法的研究

The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table

由于因特网速度不断提高、网络流量不断增加和路由表规模不断扩大 ,IP路由查找已经成为制约核心路由器性能的主要原因 ,因而受到了广泛重视 .目前人们已经提出几种高速IP路由查找算法 ,但没有一种是理想的 .本文提出一种使用压缩NH表进行IP路由查找的方法 ,它具有查找速率高、更新时间快、存储代价低、易于实现等特点 ,能满足

The problem of IP routing lookups has received much attention recently because It is one of the main reasons why performance of core routers in the Internet becomes the bottleneck.Several algorithms for solving this problem have been proposed,but none is ideal.In this paper we propose an algorithm of IP routing lookups using compressed next hop table.The algorithm has characteristics such as fast search time,fast update time,small memory space and easy implementation,and can be used in core routers that have 10Gbps interfaces.