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

PENG Yuan-xi; TANG Yu-hua; GONG Zheng-hu

您当前的位置：

首页 >

文章列表页 >

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

更新时间：2025-07-16

- The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table
- Acta Electronica Sinica Vol. 30, Issue 2, Pages: 196-199(2002)
- 作者机构：
  
  国防科学技术大学计算机学院,湖南,长沙,410073
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Published：2002
- 稿件说明：
移动端阅览
PENG Yuan-xi, TANG Yu-hua, GONG Zheng-hu. The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table[J]. Acta Electronica Sinica, 2002, 30(2): 196-199.
DOI：

PENG Yuan-xi, TANG Yu-hua, GONG Zheng-hu. The Study on High-Speed Algorithms of IP Routing Lookups Based on the Compressed Next Hop Table[J]. Acta Electronica Sinica, 2002, 30(2): 196-199. DOI：

摘要

由于因特网速度不断提高、网络流量不断增加和路由表规模不断扩大

IP路由查找已经成为制约核心路由器性能的主要原因

因而受到了广泛重视.目前人们已经提出几种高速IP路由查找算法

但没有一种是理想的.本文提出一种使用压缩NH表进行IP路由查找的方法

它具有查找速率高、更新时间快、存储代价低、易于实现等特点

能满足10Gbps速率核心路由器环境的要求.

Abstract

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.

关键词

Keywords

references

Views

1250

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

High Speed IP Lookup Algorithm with Scalability and Parallelism Based on ASIC Implementation

Related Author

TAN Ming-feng

GONG Zheng-hu

Related Institution

Institute of Computer science,National University of Defense Technology

⁰