作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (08): 50-53. doi: 10.3969/j.issn.1000-3428.2012.08.017

• 网络与通信 • 上一篇    下一篇

基于Hash和CAM的IPv6路由查找算法

王瑞青 a,杜慧敏 b,王亚刚 a   

  1. (西安邮电学院 a. 计算机学院;b. 电子工程学院,西安 710061)
  • 收稿日期:2011-08-15 出版日期:2012-04-20 发布日期:2012-04-20
  • 作者简介:王瑞青(1986-),女,硕士研究生,主研方向:计算机系统结构,IPv6网络;杜慧敏、王亚刚,教授
  • 基金资助:
    国家自然科学基金资助项目(60976020)

IPv6 Routing Lookup Algorithm Based on Hash and CAM

WANG Rui-qing a, DU Hui-min b, WANG Ya-gang a   

  1. (a. School of Computer Science and Technology; b. School of Electronic Engineering, Xi’an University of Post and Telecommunications, Xi’an 710061, China)
  • Received:2011-08-15 Online:2012-04-20 Published:2012-04-20

摘要: 分析实际网络中的IPv6前缀分布规律与增长趋势,提出一种基于Hash和内容可寻址存储器(CAM)的IPv6路由查找算法。将长度能被8整除的前缀存储在8个Hash表中,发生Hash冲突的前缀存储在CAM中,长度不能被8整除的前缀按照一定的组织方式存储在随机存取存储器中。分析结果表明,该算法具有较高的存储利用率、查找速率及更新速率,并且易于扩展和硬件实现。

关键词: IPv6路由查找, 哈希压缩, 两级查找, 流水线, 内容可寻址存储器

Abstract: This paper presents an IPv6 lookup algorithm based on Hash and Content Addressable Memory(CAM) by analyzing the prefix length distribution of routing table and the growth trend of routing table entries. The prefixes whose length can be divided by 8 are stored in 8 Hash tables, and the remaining prefixes are stored into expanded Random Access Memory(RAM). Analysis result shows that the algorithm has high efficient storage utilization, searching rate and updating rate. It is easy to be scalded in hardware.

Key words: IPv6 routing lookup, Hash compression, two-level lookup, pipeline, Content Addressable Memory(CAM)

中图分类号: