会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Pre-learning of values with later activation in a network device
    • 在网络设备中预先学习值,稍后激活
    • US20060187917A1
    • 2006-08-24
    • US11078483
    • 2005-03-14
    • Brandon SmithJun Cao
    • Brandon SmithJun Cao
    • H04L12/56H04L12/54
    • H04L49/103H04L49/201H04L49/351H04L49/506
    • A network device for processing data on a data network includes a port interface, in communication with a plurality of ports, configured to receive a data packet from a data network and to send a processed data packet to the data network and a memory access unit, in communication with the port interface and a memory having at least one table. The memory access unit is configured to read at least one value, associated with the data packet, from the at least one table, when a head of the data packet is received by the port interface and store another value in the at least one table, after the at least one value is read, when a tail of a prior data packet is received by the port interface.
    • 一种用于在数据网络上处理数据的网络设备包括与多个端口通信的端口接口,被配置为从数据网络接收数据分组,并将经处理的数据分组发送到数据网络和存储器存取单元, 与端口接口和具有至少一个表的存储器通信。 存储器访问单元被配置为当端口接口接收到数据包的头部并且在该至少一个表中存储另一个值时,从至少一个表中读取与该数据包相关联的至少一个值, 在读取至少一个值之后,当端口接口接收到先前数据分组的尾部时。
    • 3. 发明申请
    • Powerful and expandable pipeline architecture for a network device
    • 强大而可扩展的网络设备管道架构
    • US20060187918A1
    • 2006-08-24
    • US11081644
    • 2005-03-17
    • Brandon SmithJun Cao
    • Brandon SmithJun Cao
    • H04L12/56H04L12/28
    • H04L45/742H04L49/3063
    • A network device for processing data on a data network including a plurality of ports, configured to receive data packets and to send out processed data packets, a modification engine configured to parse, evaluate and modify the data packets to produce the processed data packets and a series of search engine pipeline stages configured to perform lookup searches through a plurality of search engines. The series of search engine pipeline stages perform search requests in sequential processing steps and any stage of the series of search engine pipeline stages may submit a particular search request to the plurality of search engines and receive search results particular to a particular data packet at a respective processing step.
    • 一种用于处理包括多个端口在内的数据网络上的数据的网络设备,用于接收数据分组并发送处理后的数据分组;修改引擎,被配置为解析,评估和修改数据分组以产生经处理的数据分组;以及 一系列搜索引擎流水线级配置为通过多个搜索引擎执行查找搜索。 一系列搜索引擎流水线阶段在顺序处理步骤中执行搜索请求,并且该系列搜索引擎流水线阶段的任何阶段可以向多个搜索引擎提交特定的搜索请求,并在相应的处理步骤接收特定数据分组的特定搜索结果 处理步骤。
    • 8. 发明申请
    • Method and apparatus for performing a binary search on an expanded tree
    • 用于在扩展树上执行二进制搜索的方法和装置
    • US20050033740A1
    • 2005-02-10
    • US10937321
    • 2004-09-10
    • Jun CaoBrandon SmithEric Ng
    • Jun CaoBrandon SmithEric Ng
    • G06F17/30
    • G06F17/30985Y10S707/99933
    • A method and apparatus for searching an electronically stored table of information including a plurality of table entries and facilitating high speed searching of a table to provide a longest matching entry. The table searching method uses at least one memory unit having a table of information including a plurality of data entries. The table of information has a plurality of search keys associated with the plurality of data entries and the plurality of search keys form a tree structure based on a prefix length for each of the search keys. The plurality of search keys are expanded such that each of the plurality of search keys has two lowest level search keys associated therewith that cover a lowest level of the tree structure. A binary search of the lowest level search keys is performed based on a search value to determine a longest prefix match. A data entry of the plurality of data entries is output based on said longest prefix match. The method is also applicable to routing data in an internet router where the routing of data packets depends on address information stored in the table of information.
    • 一种用于搜索电子存储的包括多个表条目的信息表的方法和装置,并且便于表的高速搜索以提供最长匹配条目。 表搜索方法使用至少一个具有包括多个数据条目的信息表的存储器单元。 信息表具有与多个数据条目相关联的多个搜索关键字,并且多个搜索关键字基于每个搜索关键字的前缀长度形成树形结构。 多个搜索键被扩展,使得多个搜索关键字中的每一个具有与其相关联的两个最低级别的搜索关键字,其覆盖树结构的最低级别。 基于搜索值来执行最低级搜索关键字的二进制搜索以确定最长的前缀匹配。 基于所述最长前缀匹配输出所述多个数据条目的数据条目。 该方法还适用于在互联网路由器中路由数据,其中数据分组的路由取决于存储在信息表中的地址信息。