首页 | 本学科首页   官方微博 | 高级检索  
     

改进的TCAM路由更新方法与实现
引用本文:苗建松,丁炜.改进的TCAM路由更新方法与实现[J].微电子学与计算机,2006,23(10):144-146,149.
作者姓名:苗建松  丁炜
作者单位:北京邮电大学,北京,100876
摘    要:基于TCAM的硬件路由查找算法能够在一个时钟周期内完成最长前缀匹配.实现快速路由查找和分组转发。但路由表表项的有序性使得更新过程比较复杂从而成为TCAM路由技术发展的瓶颈。根据不同长度前缀表项的分布特性及路由表稳态时的更新规律,优化了路由表的空间分配,并引入了缓冲池的思想.提出了一种改进的路由表更新方法,从而提高路由表更新效率。

关 键 词:路由查找  最长前缀匹配  缓冲池
文章编号:1000-7180(2006)10-0144-02
收稿时间:2006-04-28
修稿时间:2006-04-28

An Improved Method and Implementation for TCAM Route Updating
MIAO Jian-song,DING Wei.An Improved Method and Implementation for TCAM Route Updating[J].Microelectronics & Computer,2006,23(10):144-146,149.
Authors:MIAO Jian-song  DING Wei
Affiliation:Beijing University of Posts and Telecommunications, Beijing 100876
Abstract:Routing lookup algorithms based on TCAM can complete a longest prefix matching(LPM) in one cycle and implement high-speed packet routing and forwarding .But as the route table has to keep the sequence of all entries, the updating process is rather complicated and has become the bottleneck of TCAM routing techniques. Research was made on the distributing features of different-length prefixes and the updating character of route table in stable state, and the allocation of route space was optimized accordingly. Furthermore, an improved algorithm for route updating was proposed based on buffer pool(BP) to improve the updating efficiency.
Keywords:TCAM  CIDR
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号