To obtain a high-speed IP address lookup algorithm for wire-speed packet forwarding in Internet routers, a new data structure, called multilevel length-based classified index table, is proposed. This data structure can be divided into multilevel structures on the basis of prefix length distribution. Each level has a corresponding data structure and dynamic router-table operations. Experiments were performed using real-world routing databases, wherein the proposed data structure was compared with other structures by using the benchmark IPv4 and IPv6 prefix databases AS1221, AS4637, AS6447, AS1221*, and AS6447*. The average lookup time and the average update time of the proposed structure were superior to those of the other data structures; the memory requirement was lower than that of simple structures, such as prefix trees and priority tries.

为了获得用于Internet路由器中线速数据包转发的高速IP地址查找算法，提出了一种新的数据结构，称为多级基于长度的分类索引表。根据前缀长度分布，该数据结构可以分为多层结构。每个级别都有对应的数据结构和动态路由器表操作。使用真实世界的路由数据库进行了实验，其中通过使用基准IPv4和IPv6前缀数据库AS1221，AS4637，AS6447，AS1221 *和AS6447 *，将建议的数据结构与其他结构进行了比较。所提出的结构的平均查找时间和平均更新时间优于其他数据结构。内存要求比简单结构（如前缀树和优先级尝试）要低。