期刊文献+

动态快速路由查找算法 被引量:1

Dynamical Fast IP-Routing Lookup Algorithm
下载PDF
导出
摘要 给出了动态快速路由查找算法 (DFR)的原理和实现。该算法采用特殊的数据结构来构建索引表 ,能支持动态插入、删除和更新路由 ;DFR算法最多 4次访存 ,最少 2次访存 ,就能找到完整的路由信息。该算法不仅适用于软件实现 ,而且由于查找简单 ,也适合于硬件实现。 This paper proposes a dynamical fast IP routing lookup algorithm (DFR). This algorithm uses special data structure to construct index table, and can support inserting, deleting and updating route dynamically. DFR algorithm accesses memory at most four times and at least two times for a route look up. DFR is suitable not only for hardware implementation but also for software implementation. [
作者 刘亚林
出处 《中国工程科学》 2002年第7期60-68,共9页 Strategic Study of CAE
关键词 动态快速路由查找算法 前缀扩展 DFR 路由查找 设计 路由器 prefix expansion dynamical fast IP routing lookup algorithm (DFR) route route lookup
  • 引文网络
  • 相关文献

参考文献4

  • 1Nilsson S, Karlsson G. IP-address lookup using LC-Tries[J]. IEEE Journal on Selected Areas in Communications,1999,17(6): 1083~ 1092
  • 2Henry Hongyi, Tzeng. On fast address-lookup algorithms[J]. IEEE Journal on Selected Areas in Communications,1999,17(6): 1067~ 1082
  • 3Huang Nenfu, Zhao Shiming. A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers [J]. IEEE Journal on Seleted Areas in Communications, 1999,17(6): 1093~ 1104
  • 4Gupta P, Lin S, McKeown M. Routing lookups in hardware at memory access speeds [ A ]. Proc IEEE INFOCOM'98 [C], Session 10B-1, San Francisco, CA,1998. 1240~ 1247

同被引文献4

引证文献1

二级引证文献3

;
使用帮助 返回顶部