摘要
本文在比较各种基于树型结构查找算法的基础上提出了一种改进的路由查找算法,该算法具有查找速度快、所需存储空间小、更新速度快、硬件实现简单等特点,能够满足10Gbps核心路由器环境的要求。
Based on the survey of some novel tree-structure lookup algorithms, accompanied by a set of practical requirements that are critical to the design of high-speed routing devices, this paper proposes a new lookup algorithm using a data structure that compactly encodes large prefix tables, while requiring only a small number of memory accesses to perform each address lookup. The scheme can be instantiated to achieve wire speed forwarding at lOGbps rates in a backbone routing environment.
出处
《计算机工程与科学》
CSCD
2004年第1期22-25,共4页
Computer Engineering & Science
