首页> 外国专利> Method of Constructing the Pipe-Lined Content Addressable Memory for High Speed Lookup of Longest Prefix Matching Algorithm in Internet Protocol Address Lookup

Method of Constructing the Pipe-Lined Content Addressable Memory for High Speed Lookup of Longest Prefix Matching Algorithm in Internet Protocol Address Lookup

机译:Internet协议地址查找中最长前缀匹配算法的高速查找的流水线内容可寻址存储器的构造方法

摘要

PURPOSE: A method for configuring a pipeline CAM(Content Addressable Memory) for fast LPM(Longest Prefix Matching) searching in an IP address lookup process is provided to efficiently apply to fast LPM searching among the IP address lookup process of a router. CONSTITUTION: An input packet IP address(701), input data, is segmented by 4 bits, and total 32 bits are inputted to key field blocks 0 through 7. Each of the key field blocks(702) simultaneously executes a search to confirm whether the inputted 4-bit data exist in the CAM memory array of each key field block. Then each key field block supplies a searched result to a match block search and match vector generation logic(703). Based on the results of key field blocks 0 through 7, the match block search and match vector generation logic searches up to which key field block matching has been made.
机译:目的:提供一种用于在IP地址查找过程中配置用于快速LPM(最长前缀匹配)搜索的流水线CAM(内容可寻址存储器)的方法,以有效地应用于路由器的IP地址查找过程中的快速LPM搜索。组成:输入数据包IP地址(701),输入数据,按4位分段,总共32位输入到关键字段块0到7。每个关键字段块(702)同时执行搜索以确认是否输入的4位数据存在于每个关键字段块的CAM存储阵列中。然后,每个关键字段块将搜索结果提供给匹配块搜索和匹配矢量生成逻辑(703)。根据关键字段块0到7的结果,匹配块搜索和匹配向量生成逻辑将搜索直到进行了关键字段块匹配为止。

著录项

  • 公开/公告号KR20020074780A

    专利类型

  • 公开/公告日2002-10-04

    原文格式PDF

  • 申请/专利权人 AHN HEE IL;JO TAE WON;

    申请/专利号KR20010014778

  • 发明设计人 AHN HEE IL;JO TAE WON;

    申请日2001-03-22

  • 分类号H04L12/56;

  • 国家 KR

  • 入库时间 2022-08-22 00:30:18

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号