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

    公开(公告)号:US20120084245A1

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

    申请号:US13252776

    申请日:2011-10-04

    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
    2.
    发明授权
    Positionally dependent pattern checking in character strings using deterministic finite automata 有权
    使用确定性有限自动机的字符串中的位置依赖模式检查

    公开(公告)号:US08060546B2

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

    申请号:US11848302

    申请日:2007-08-31

    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.

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

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

    公开(公告)号:US08275818B2

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

    申请号:US13252776

    申请日:2011-10-04

    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.

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

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

    公开(公告)号:US20080059464A1

    公开(公告)日:2008-03-06

    申请号:US11848302

    申请日:2007-08-31

    IPC分类号: G06F7/02 G06F17/30

    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 aninitial 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.

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

    Signature checking using deterministic finite state machines
    5.
    发明授权
    Signature checking using deterministic finite state machines 有权
    使用确定性有限状态机进行签名检查

    公开(公告)号:US08331404B2

    公开(公告)日:2012-12-11

    申请号:US11923869

    申请日:2007-10-25

    IPC分类号: H04J1/02

    摘要: 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.

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

    CASCADE SYSTEM FOR NETWORK UNITS
    6.
    发明申请
    CASCADE SYSTEM FOR NETWORK UNITS 有权
    网络单元的CASCADE系统

    公开(公告)号:US20080037531A1

    公开(公告)日:2008-02-14

    申请号:US11857512

    申请日:2007-09-19

    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.

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

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

    公开(公告)号:US20080101371A1

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

    申请号:US11923869

    申请日:2007-10-25

    IPC分类号: H04L12/56

    摘要: 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.

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

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

    公开(公告)号:US08879444B2

    公开(公告)日:2014-11-04

    申请号:US13526251

    申请日:2012-06-18

    IPC分类号: H04B7/00 H04L12/433

    CPC分类号: H04L12/433

    摘要: In one embodiment, a method is described for detecting an operational failure between the network unit and an adjacent network unit in the stack; controlling the switching engine to redirect packets which would otherwise be sent from a particular port to the adjacent network unit to be forwarded from another port to be sent to a different network unit in the stack; and entering the switching engine into a bypass mode in response to control data indicating an operational failure between at least two other network units in the stack to cause packets to be forwarded without being re-directed by the switching engine.

    摘要翻译: 在一个实施例中,描述了一种用于检测网络单元和堆叠中的相邻网络单元之间的操作故障的方法; 控制交换引擎将否则将从特定端口发送到相邻网络单元的分组,以从要发送到堆栈中的不同网络单元的另一端口转发; 以及响应于指示所述堆叠中的至少两个其他网络单元之间的操作故障的控制数据,将所述交换引擎进入旁路模式,以使转发引擎不重新引导分组。

    Network units for use in and organisation of cascade systems
    10.
    发明授权
    Network units for use in and organisation of cascade systems 有权
    用于级联系统的网络单元和组织

    公开(公告)号:US07522589B2

    公开(公告)日:2009-04-21

    申请号:US10337299

    申请日:2003-01-07

    IPC分类号: H04L12/28

    摘要: A multi-port network unit for use in a cascade system of network units sends from a cascade port a packet including a special header having a source port ID, a destination port ID and a ‘destination port known’ field. The port IDs identify both a unit and a port within a unit. A routing database is set up, optionally by a discovery protocol, in terms of ports and either destination units (within the cascade) or source units (within the cascade). The database includes a mesh table, indicating from which cascade port a packet with a known destination port ID should be forwarded, without needing a fresh look-up. The database also includes a multicast exclusion table which allows ingress of packets with source unit IDs matched to an ingress port. The scheme allows a general mesh type of cascade while dynamically preventing closed loops.

    摘要翻译: 用于网络级联系统的多端口网络单元从级联端口发送包括具有源端口ID,目的端口ID和“目的端口已知”字段的特殊报头的分组。 端口ID标识单元中的单元和端口。 根据端口和目标单元(级联)或源单元(级联内),路由数据库可选地由发现协议来设置。 数据库包括网格表,指示哪个级联端口具有应该转发具有已知目的地端口ID的分组,而不需要新的查找。 该数据库还包括一个组播排除表,允许进入与进入端口匹配的源单元ID的数据包。 该方案允许一般网格类型的级联,同时动态地防止闭环。