利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

38 条记录 (耗时 0.035 秒)

    Cascade system for network units
    21.
    发明授权
    Cascade system for network units 有权
    级联系统为网络单元

    公开(公告)号：US08213420B2

    公开(公告)日：2012-07-03

    申请号：US11857512

    申请日：2007-09-19

    申请人： Bryan J Donoghue ,  Quang T Tran ,  Eugene O'Neill ,  David J Law ,  Paul J Moran ,  Edele O'Malley ,  Jerome Nolan ,  Kam Choi ,  Maunte A Goodfellow

    发明人： Bryan J Donoghue ,  Quang T Tran ,  Eugene O'Neill ,  David J Law ,  Paul J Moran ,  Edele O'Malley ,  Jerome Nolan ,  Kam Choi ,  Maunte A Goodfellow

    IPC分类号： H04L12/50

    CPC分类号： H04L12/433

    摘要： A network stack includes a plurality of network units each of which includes a multiplicity of ports for receiving and forwarding addressed data packets, at least two cascade ports and a switching engine for forwarding received packets to at least one port in accordance with address data in the packets and a cascade connection including, for each of two opposite directions around the stack, at least one unidirectional path for data packets composed of links each between a respective cascade port on a network unit and a corresponding cascade port on the next network unit.

    摘要翻译： 网络堆栈包括多个网络单元，每个网络单元包括用于接收和转发寻址的数据分组的多个端口，至少两个级联端口和用于根据所述数据分组中的地址数据将接收的分组转发到至少一个端口的交换引擎 分组和级联连接包括针对堆叠周围的两个相反方向中的每一个，至少一个用于由网络单元上的相应级联端口和下一个网络单元上的对应级联端口之间的链路组成的数据分组的单向路径。

    POSITIONALLY DEPENDENT PATTERN CHECKING IN CHARACTER STRINGS USING DETERMINISTIC FINITE AUTOMATA
    22.
    发明申请
    POSITIONALLY DEPENDENT PATTERN CHECKING IN CHARACTER STRINGS USING DETERMINISTIC FINITE AUTOMATA 有权
    使用确定性有限自动机器的字符串中的垂直相关图案检查

    公开(公告)号：US20120084245A1

    公开(公告)日：2012-04-05

    申请号：US13252776

    申请日：2011-10-04

    申请人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    发明人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    IPC分类号： G06N5/02

    CPC分类号： H04L45/742 ,  H04L69/22

    摘要： An apparatus including logic to receive a data packet comprising a string of characters, said apparatus having a plurality of states and at least one state for every character position in the string of characters; logic to examine the string of characters for matches with a plurality of predefined values, beginning with an initial character; and logic to execute forward exit transitions from any of the plurality of states based upon the examination of the characters, wherein a current state of the apparatus represents a count of a number of characters from the initial character of the string of characters.

    摘要翻译： 一种装置，包括用于接收包括一串字符的数据分组的逻辑，所述装置具有多个状态，并且至少一个状态用于字符串中的每个字符位置; 检查用于与初始字符开始的多个预定义值匹配的字符串的逻辑; 以及基于对所述字符的检查来执行从所述多个状态中的任何一个状态的向前退出转换的逻辑，其中所述装置的当前状态表示从所述字符串的初始字符开始的字符数的计数。

    Positionally dependent pattern checking in character strings using deterministic finite automata
    23.
    发明授权
    Positionally dependent pattern checking in character strings using deterministic finite automata 有权
    使用确定性有限自动机的字符串中的位置依赖模式检查

    公开(公告)号：US08060546B2

    公开(公告)日：2011-11-15

    申请号：US11848302

    申请日：2007-08-31

    申请人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    发明人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    IPC分类号： G06F7/00

    CPC分类号： H04L45/742 ,  H04L69/22

    摘要： A deterministic finite state machine organised for the detection of positionally significant matches of characters in a string of characters examines each character in turn to determine a exit transition for a current state of the machine to another state The machine responds to an examination of the string of characters by executing in response to a first character at the commencement of the string a transition from an initial state to another state. The machine has at least one state for every character position, includes a exit transition from each state for each character to another state; and possesses only forward exit transitions each from any of the states whereby the current state of the machine unambiguously represents a count of the number of characters from the commencement of the string. The machine may include at least one match state which indicates that all character matches in the string required by at least one respective rule have been detected. Some but not all the states in the multiplicity of states each have a single exit transition for any value of a respective character in the string. At least some of the states in the multiplicity of states each define an exit transition to a state indicating ‘no match’. The machine may be disposed to cease its examination of the character string on attaining a ‘no match’state.

    摘要翻译： 组织为用于检测字符串中的字符的位置有意义的匹配的确定性有限状态机依次检查每个字符以确定机器的当前状态到另一状态的退出转换。机器响应于对字符串的检查 通过在字符串开始时响应于第一个字符执行从初始状态到另一状态的转变的字符。 机器对于每个字符位置至少有一个状态，包括从每个字符到另一个状态的每个状态的退出转换; 并且仅具有从任何状态的前向退出转换，由此机器的当前状态明确地表示从字符串的开始处的字符数的计数。 机器可以包括至少一个匹配状态，其指示已经检测到至少一个相应规则所需的字符串中的所有字符匹配。 多个状态中的一些但不是全部状态各自对于字符串中相应字符的任何值都具有单个退出转换。 多个状态中的至少一些状态各自定义到指示“不匹配”的状态的退出转换。 可以处理机器以在获得“不匹配”状态时停止对字符串的检查。

    Content addressable memory organized to share entries between different entities such as ports of a network unit
    24.
    发明授权
    Content addressable memory organized to share entries between different entities such as ports of a network unit 有权
    内容可寻址存储器被组织以在诸如网络单元的端口的不同实体之间共享条目

    公开(公告)号：US07480300B2

    公开(公告)日：2009-01-20

    申请号：US11064258

    申请日：2005-02-22

    申请人： Daniel Martin O'Keeffe ,  Eugene O'Neill ,  Edele O'Malley ,  Eoin O'Brien

    发明人： Daniel Martin O'Keeffe ,  Eugene O'Neill ,  Edele O'Malley ,  Eoin O'Brien

    IPC分类号： H04L12/28 ,  G06F7/04

    CPC分类号： G06F17/30982 ,  H04L45/7453 ,  H04L49/90

    摘要： A content addressable memory stores entries each comprising a rule and as part of the entry a mask identifying all the entities to which the rule is applicable. A search pattern of data and a bit mask identifying the actual entity (or entities) associated with the data is applied as a search word along with a comparison mask that excludes all the other entities from the comparison of the search word with the entry. The CAM can thereby store efficiently in a single entry a rule that may be applicable to some but not all of a multiplicity of entities such as possible ingress ports of a network unit.

    摘要翻译： 内容可寻址存储器存储每个包括规则的条目，并且作为该条目的一部分，掩码标识规则所适用的所有实体。 将与数据相关联的实际实体（或实体）的搜索模式和位掩码应用为搜索词，以及将搜索词与条目的比较排除所有其他实体的比较掩码。 因此，CAM可以在单个条目中有效地存储可适用于多个实体中的一些而不是全部的规则，例如网络单元的可能入口端口。

    High-speed switch architecture
    25.
    发明授权
    High-speed switch architecture 有权
    高速交换架构

    公开(公告)号：US07420968B2

    公开(公告)日：2008-09-02

    申请号：US10456702

    申请日：2003-06-06

    申请人： Bryan J. Donoghue ,  Richard A. Gahan ,  Kam Choi ,  Edele O'Malley ,  Eugene O'Neill

    发明人： Bryan J. Donoghue ,  Richard A. Gahan ,  Kam Choi ,  Edele O'Malley ,  Eugene O'Neill

    IPC分类号： H04L12/50 ,  H04Q11/00

    CPC分类号： H04L49/1515

    摘要： A system of switch modules contains input demultiplexers connected to ports on each of the modules and output multiplexers connected to each of the modules. Each module has output and input interfaces for mesh links and at least one output interface is looped back to an input interface on the same module. The arrangement reduces module-to-module traffic and corresponding increases the transmit bandwidth of a module.

    摘要翻译： 开关模块的系统包括连接到每个模块上的端口的输入解复用器和连接到每个模块的输出多路复用器。 每个模块都具有用于网格链接的输出和输入接口，并且至少一个输出接口循环回相同模块上的输入接口。 该装置减少了模块到模块的流量，并且相应地增加了模块的传输带宽。

    SIGNATURE CHECKING USING DETERMINISTIC FINITE STATE MACHINES
    26.
    发明申请
    SIGNATURE CHECKING USING DETERMINISTIC FINITE STATE MACHINES 有权
    使用确定性有限状态机器进行签名检查

    公开(公告)号：US20080101371A1

    公开(公告)日：2008-05-01

    申请号：US11923869

    申请日：2007-10-25

    申请人： David Law ,  Edele O'Malley ,  Daniel O'Keeffe ,  Eugene O'Neill

    发明人： David Law ,  Edele O'Malley ,  Daniel O'Keeffe ,  Eugene O'Neill

    IPC分类号： H04L12/56

    CPC分类号： H04L69/16 ,  H04L63/0236 ,  H04L63/0245 ,  H04L63/0263 ,  H04L63/1416 ,  H04L69/161 ,  H04L69/22

    摘要： The occurrence of false positives and the post-processing of digital streams subjected to examination by a deterministic finite state machine for character strings are reduced by combining location-based pattern matching, e.g. on packet headers, and content-based pattern matching, e.g. on payloads of packets. One scheme allows automatic transition from a header match state into an initial state of a content matching machine. Another scheme is based on a rules graph defining strings of match states and the examination of a list of match states (rather than characters) which have been previously determined, for example by means of header matching and content matching. The latter is also capable of comparing offset and depth values associated with the match states with offset and depth criteria.

    摘要翻译： 通过组合基于位置的模式匹配，例如，通过组合基于位置的模式匹配来减少误报的发生和经过用于字符串的确定性有限状态机检查的数字流的后处理。 分组报头和基于内容的模式匹配，例如， 在包的有效载荷上。 一种方案允许从头匹配状态自动转换到内容匹配机器的初始状态。 另一种方案是基于定义匹配状态串的规则图，并且例如通过标题匹配和内容匹配来检查先前确定的匹配状态（而不是字符）的列表。 后者还能够将与匹配状态相关联的偏移和深度值与偏移和深度标准进行比较。

    Content addressable memory organized to share entries between different entities such as ports of a network unit
    27.
    发明申请
    Content addressable memory organized to share entries between different entities such as ports of a network unit 有权
    内容可寻址存储器被组织以在诸如网络单元的端口的不同实体之间共享条目

    公开(公告)号：US20060120373A1

    公开(公告)日：2006-06-08

    申请号：US11064258

    申请日：2005-02-22

    申请人： Daniel O'Keeffe ,  Eugene O'Neill ,  Edele O'Malley ,  Eoin O'Brien

    发明人： Daniel O'Keeffe ,  Eugene O'Neill ,  Edele O'Malley ,  Eoin O'Brien

    IPC分类号： H04L12/28

    CPC分类号： G06F17/30982 ,  H04L45/7453 ,  H04L49/90

    摘要： A content addressable memory stores entries each comprising a rule and as part of the entry a mask identifying all the entities to which the rule is applicable. A search pattern of data and a bit mask identifying the actual entity (or entities) associated with the data is applied as a search word along with a comparison mask that excludes all the other entities from the comparison of the search word with the entry. The CAM can thereby store efficiently in a single entry a rule that may be applicable to some but not all of a multiplicity of entities such as possible ingress ports of a network unit

    摘要翻译： 内容可寻址存储器存储每个包括规则的条目，并且作为该条目的一部分，掩码标识规则所适用的所有实体。 将与数据相关联的实际实体（或实体）的搜索模式和位掩码应用为搜索词，以及将搜索词与条目的比较排除所有其他实体的比较掩码。 因此，CAM可以在单个条目中有效地存储可适用于一些但不是全部多个实体的规则，例如网络单元的可能入口端口

    Programmable FIFO memory scheme
    28.
    发明授权
    Programmable FIFO memory scheme 有权
    可编程FIFO存储器方案

    公开(公告)号：US06233651B1

    公开(公告)日：2001-05-15

    申请号：US08981140

    申请日：1999-01-20

    申请人： Eugene O'Neill ,  Anne O'Connell

    发明人： Eugene O'Neill ,  Anne O'Connell

    IPC分类号： G06F1200

    CPC分类号： G06F5/065

    摘要： A large FIFO memory device has its total available memory capacity partitioned into memory sections. The partitions are in the form of programmable delimiters in order to determine flexibly the size of the memory sections.

    摘要翻译： 一个大的FIFO存储器设备的总可用内存容量分为存储器部分。 这些分区是可编程分隔符的形式，以便灵活地确定存储器部分的大小。

    Positionally dependent pattern checking in character strings using deterministic finite automata
    30.
    发明授权
    Positionally dependent pattern checking in character strings using deterministic finite automata 有权
    使用确定性有限自动机的字符串中的位置依赖模式检查

    公开(公告)号：US08275818B2

    公开(公告)日：2012-09-25

    申请号：US13252776

    申请日：2011-10-04

    申请人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    发明人： David Law ,  Peter Furlong ,  Eugene O'Neill ,  Kevin Loughran

    IPC分类号： G06F7/00

    CPC分类号： H04L45/742 ,  H04L69/22

    摘要： An apparatus including logic to receive a data packet comprising a string of characters, said apparatus having a plurality of states and at least one state for every character position in the string of characters; logic to examine the string of characters for matches with a plurality of predefined values, beginning with an initial character; and logic to execute forward exit transitions from any of the plurality of states based upon the examination of the characters, wherein a current state of the apparatus represents a count of a number of characters from the initial character of the string of characters.

    摘要翻译： 一种装置，包括用于接收包括一串字符的数据分组的逻辑，所述装置具有多个状态，并且至少一个状态用于字符串中的每个字符位置; 检查用于与初始字符开始的多个预定义值匹配的字符串的逻辑; 以及基于对所述字符的检查来执行从所述多个状态中的任何一个状态的向前退出转换的逻辑，其中所述装置的当前状态表示从所述字符串的初始字符开始的字符数的计数。