首页> 外国专利> Method and apparatus for compiling search trees for processing request keys based on a key size supported by underlying processing elements

Method and apparatus for compiling search trees for processing request keys based on a key size supported by underlying processing elements

机译:用于基于基础处理元件所支持的密钥大小来编译用于处理请求密钥的搜索树的方法和装置

摘要

A packet classification system, methods, and apparatus are provided for packet classification. A processor of a router coupled to a network compiles at least one search tree based on a rules set. The processor determines an x number of search phases needed to process an incoming key corresponding to the rules set, wherein the rules set includes a plurality of rules, where each of the plurality of rules includes an n number of rule fields and where the incoming key includes an n number of processing fields. The processor generates an x set of search trees, where each of the x set of search trees corresponds to a respective one of the x number of search phases. Also, the processor provides the x set of search trees to a search processor, where each of the x set of search trees is configured to process respective portions of the incoming key.
机译:提供了用于分组分类的分组分类系统,方法和装置。耦合到网络的路由器的处理器基于规则集来编译至少一个搜索树。处理器确定处理与规则集相对应的进入键所需的x个搜索阶段,其中规则集包括多个规则,其中多个规则中的每个包括n个规则字段,并且进入键包括n个处理字段。处理器生成x组搜索树,其中x组搜索树中的每一个对应于x个搜索阶段中的相应一个。而且,处理器将x组搜索树提供给搜索处理器,其中x组搜索树中的每一个都配置为处理输入密钥的各个部分。

著录项

  • 公开/公告号US9432284B2

    专利类型

  • 公开/公告日2016-08-30

    原文格式PDF

  • 申请/专利权人 CAVIUM INC.;

    申请/专利号US201414150572

  • 发明设计人 KENNETH BULLIS;RAJAN GOYAL;

    申请日2014-01-08

  • 分类号H04L12/28;H04L12/753;H04L12/751;H04L12/851;H04L12/741;

  • 国家 US

  • 入库时间 2022-08-21 14:29:29

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号