利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

36 条记录 (耗时 0.033 秒)

    Algorithm to bypass L4 processing in an internet protocol forwarding processor
    12.
    发明授权
    Algorithm to bypass L4 processing in an internet protocol forwarding processor 有权
    在互联网协议转发处理器中绕过L4处理的算法

    公开(公告)号：US06700883B1

    公开(公告)日：2004-03-02

    申请号：US09543145

    申请日：2000-04-05

    申请人： Anthony Matteo Gallo ,  Brahmanand Kumar Gorti ,  Donald Newland Jones ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Anthony Matteo Gallo ,  Brahmanand Kumar Gorti ,  Donald Newland Jones ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L1256

    CPC分类号： H04L29/06 ,  H04L69/32

    摘要： A controllable mechanism for by-passing Layer 4 (L4) classification is based on the insertion into a set of Layer 3 (L3) rules in an L3 lookup tree set of Layer 4 (L4) Classification Required Flags. The state of the L4 classification flag is set by comparing the L4 classification rule to an IP (Internet Protocol) lookup rule. Routing is accomplished by selecting which rule to apply to the data packet and reading the state of the corresponding L4 Classification Required Flag. In response to a first state of the corresponding L4 Classification Required Flag, an L4 classification is performed followed by a routing of the data packet. In response to a second state of the corresponding L4 Classification Required Flag performing a routing of said data packet. In a second embodiment, the method inserts into a set of L3 rules in L3 lookup means a set L4 Classification Required Flags and Global Flags. A first state of the L4 Classification Required Flag is set when a new rule is added to L4 classification means, the new rule being correlatable to a single entry in L3 lookup means. Routing is accomplished by selecting which rule to apply to the data packet and reading the state of the corresponding L4 classification required flag. In response to a first state of the corresponding L4 classification flag, a L4 classification is performed followed by a routing of the data packet. In response to a second state of the corresponding L4 classification flag, the state of the Global Flag is read, and in response to a first state of the Global flag, a L4 classification is performed followed by a routing of the data packet. In response to a second state of the Global Flag, the data packet is routed.

    摘要翻译： 用于旁路第4层（L4）分类的可控机制是基于在第4层（L4）分类要求标志的L3查找树集中插入到一组第3层（L3）规则中。 通过将L4分类规则与IP（因特网协议）查找规则进行比较来设定L4分类标志的状态。 通过选择应用于数据包的规则并读取相应的L4分类要求标志的状态来完成路由。 响应于对应的L4分类要求标志的第一状态，执行L4分类，然后进行数据分组的路由。 响应于相应的L4分类要求标志的第二状态来执行所述数据分组的路由。 在第二实施例中，该方法在L3查找中插入一组L3规则，即集合L4分类要求标志和全局标志。 当将新规则添加到L4分类装置时，设置L4分类要求标志的第一状态，新规则可与L3查找装置中的单个条目相关。 通过选择应用于数据包的规则并读取相应的L4分类所需标志的状态来完成路由。 响应对应的L4分类标志的第一状态，执行L4分类，然后进行数据分组的路由。 响应对应的L4分类标志的第二状态，读取全局标志的状态，并且响应于全局标志的第一状态，执行L4分类，然后进行数据分组的路由。 响应全局标志的第二状态，数据包被路由。

    System method and computer program for prioritizing filter rules
    13.
    发明授权
    System method and computer program for prioritizing filter rules 失效
    用于优先排序过滤规则的系统方法和计算机程序

    公开(公告)号：US06484171B1

    公开(公告)日：2002-11-19

    申请号：US09540333

    申请日：2000-03-31

    申请人： Everett Arthur Corl, Jr. ,  Anthony Matteo Gallo ,  Clark Debs Jeffries ,  Colin Beaton Verrilli

    发明人： Everett Arthur Corl, Jr. ,  Anthony Matteo Gallo ,  Clark Debs Jeffries ,  Colin Beaton Verrilli

    IPC分类号： G06F1730

    CPC分类号： H04L47/10 ,  H04L45/00 ,  H04L47/20 ,  Y10S707/99937 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： This process accepts rule domination declarations and subjects rules to a computer program which either finds a type of administrative error (cyclic domination) or assigns a priority number to each rule so that any two rules which intersect (some key fits both rules) have necessarily different priority numbers. In the case that priority numbers are assigned, the process goes on to check for a second type of administrative error, namely inclusion of a first rule in a second (every key which fits the first rule also fits the second), and with the second having higher priority (so that the first is never referenced). If neither error occurs, then the number of different priority numbers is minimized. Every key when tested by such a rule set with neither error must fit either no rules at all or must fit exactly one rule with highest priority. In the latter case, the action of the unambiguously determined rule can then be applied to the packet represented by the key.

    摘要翻译： 该过程接受规则控制声明和主体规则到计算机程序，该计算机程序找到一种管理错误（循环统治）或为每个规则分配一个优先级号，以便相交的任何两个规则（一些关键符合两条规则）必然不同 优先级数字。 在分配优先级编号的情况下，进程继续检查第二种类型的管理错误，即在第二种类型中包括第一规则（适合第一规则的每个密钥也适合第二规则），并且与第二类 具有较高的优先级（使得第一个从未被引用）。 如果没有发生错误，则不同优先级号码的数量被最小化。 每个密钥通过既不具有错误的规则进行测试时，也不能完全符合任何规则，也不能完全符合一个具有最高优先级的规则。 在后一种情况下，明确确定的规则的动作可以应用于由密钥表示的分组。

    Hybrid longest prefix match and fixed match searches
    14.
    发明授权
    Hybrid longest prefix match and fixed match searches 失效
    混合最长前缀匹配和固定匹配搜索

    公开(公告)号：US06792423B1

    公开(公告)日：2004-09-14

    申请号：US09723717

    申请日：2000-11-28

    申请人： Clark Debs Jeffries ,  Anthony Matteo Gallo ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Clark Debs Jeffries ,  Anthony Matteo Gallo ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： G06T1730

    CPC分类号： G06F17/30985 ,  H04L29/12801 ,  H04L61/6004 ,  Y10S707/99936

    摘要： A method and system for finding a longest matching prefix for an input keyword from among multiple prefixes. The prefixes are data strings of varying lengths wherein prefixes of length n or greater are probabilistically a longest prefix match. The method of the present invention begins by mapping the prefixes of length greater than or equal to n1, that is, in the interval [n1, L], into a first lookup system. Remaining prefixes of length less than n1 but greater than or equal to n2, that is, in the interval [n2, n1−1], are mapped into a second index utilizing a second hash function, wherein n2 is less than n1. Further lookup systems on prefixes having lengths in the intervals [n3, n2−1], [n4, n3−1], and so on, may also be utilized, as determined by optimization studies and the statistics of routing tables.

    摘要翻译： 一种用于从多个前缀中为输入关键字找到最长匹配前缀的方法和系统。 前缀是具有不同长度的数据串，其长度为n或更大的前缀概率地是最长前缀匹配。 本发明的方法首先将长度大于或等于n1的前缀，即间隔[n1，L]映射到第一查找系统中。 长度小于n1但大于或等于n2的剩余前缀，即在间隔[n2，n1-1]中，使用第二散列函数映射到第二索引，其中n2小于n1。 还可以利用在间隔[n3，n2-1]，[n4，n3-1]等中具有长度的前缀上的进一步查找系统，如通过优化研究和路由表的统计确定的。

    Algorithm to bypass L4 processing in an internet protocol forwarding processor
    15.
    发明授权
    Algorithm to bypass L4 processing in an internet protocol forwarding processor 失效
    在互联网协议转发处理器中绕过L4处理的算法

    公开(公告)号：US06654372B1

    公开(公告)日：2003-11-25

    申请号：US09543144

    申请日：2000-04-05

    申请人： Francis Arts ,  Olivier Didier Duroyon ,  Anthony Matteo Gallo ,  Brahmanand Kumar Gorti ,  Donald Newland Jones ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    发明人： Francis Arts ,  Olivier Didier Duroyon ,  Anthony Matteo Gallo ,  Brahmanand Kumar Gorti ,  Donald Newland Jones ,  Natarajan Vaidhyanathan ,  Colin Beaton Verrilli

    IPC分类号： H04L1256

    CPC分类号： H04L45/00 ,  H04L45/302

    摘要： A controllable mechanism for by-passing Layer 4 (L4) classification is based on the insertion into a set of MAC rules in SA MAC lookup means a set of Layer 4 (L4) Skip Classification Flags. Routing is accomplished by selecting which rule to apply to the packet and reading the state of the corresponding L4 Skip Classification Flag. In response to a first state of said corresponding L4 Skip Classification Flag, performing an L4 classification followed by a routing of the data packet. In response to a second state of said corresponding L4 Skip Classification Flag, reading the state of a Global Classification Flag. In response to a first state of said Global Classification Flag, performing an L4 classification followed by a routing of said data packet. In response to a second state of said Global Classification Flag performing a routing of the data packet. The L4 Skip option change does not use the option change of reading the L4 Skip Classification Flag from the port table, whereas the second embodiment uses this option. The third and fourth embodiments are similar to the first and second embodiments but with the. addition of inserting into a set of Layer 3 (L3) rules in L3 lookup means a set of Layer 4 (L4) Classification Required Flags. The third embodiment does not use the option of reading the L4 Skip Classification Flag from the port table, whereas the fourth embodiment uses this option.

    摘要翻译： 用于旁路第4层（L4）分类的可控机制是基于在SA MAC查找中插入一组MAC规则的方法，即一组第4层（L4）跳过分类标志。 通过选择哪个规则应用于分组并读取相应的L4跳过分类标志的状态来完成路由。 响应于所述对应的L4跳过分类标志的第一状态，执行L4分类，然后进行数据分组的路由。 响应于所述对应的L4跳过分类标志的第二状态，读取全局分类标志的状态。 响应于所述全局分类标志的第一状态，执行L4分类，然后进行所述数据分组的路由。 响应于所述全局分类标志的第二状态执行数据分组的路由。 L4跳过选项更改不使用从端口表读取L4跳过分类标志的选项更改，而第二个实施例使用此选项。 第三和第四实施例类似于第一和第二实施例，但是与。 在L3查找中插入到一组第3层（L3）规则中的添加意味着一组第4层（L4）分类要求标志。 第三实施例不使用从端口表读取L4跳过分类标志的选项，而第四实施例使用该选项。

    Method for bridging and routing data frames via a network switch comprising a special guided tree handler processor
    16.
    发明授权
    Method for bridging and routing data frames via a network switch comprising a special guided tree handler processor 失效
    用于通过包括特殊引导树处理器处理器的网络交换机桥接和路由数据帧的方法

    公开(公告)号：US06907469B1

    公开(公告)日：2005-06-14

    申请号：US09546981

    申请日：2000-04-11

    申请人： Anthony Matteo Gallo ,  Natarajan Vaidhyanathan ,  Gail Irene Woodland

    发明人： Anthony Matteo Gallo ,  Natarajan Vaidhyanathan ,  Gail Irene Woodland

    IPC分类号： H04L12/56 ,  G06F15/173 ,  H04L12/28

    CPC分类号： H04L45/00 ,  H04L45/60

    摘要： Certain Layer 3 protocol data frames propagated on a network are typically processed by a control point (CP) in a network switch. The logical bridging and routing functions required in this processing typically entail network device address look-ups in routing tables and address databases. Using the CP to perform these look-ups is expensive in terms of processor cycles and memory. To offload the CP, the bridging functions are performed a network processor in the switch. The network processor has specialized software and hardware enabling it to perform the required database look-ups faster and more efficiently than the CP.

    摘要翻译： 在网络上传播的某些第3层协议数据帧通常由网络交换机中的控制点（CP）处理。 该处理中所需的逻辑桥接和路由功能通常需要路由表和地址数据库中的网络设备地址查找。 使用CP执行这些查找在处理器周期和内存方面是昂贵的。 要卸载CP，桥接功能在交换机中执行网络处理器。 网络处理器具有专门的软件和硬件，使其能够比CP更快更有效地执行所需的数据库查找。

    Multicast forwarding table processor
    18.
    发明授权
    Multicast forwarding table processor 失效
    组播转发表处理器

    公开(公告)号：US06772222B1

    公开(公告)日：2004-08-03

    申请号：US09545576

    申请日：2000-04-07

    申请人： Anthony Matteo Gallo ,  Sonia Kiang Rovner ,  Natarajan Vaidhyanathan ,  Gail Irene Woodland

    发明人： Anthony Matteo Gallo ,  Sonia Kiang Rovner ,  Natarajan Vaidhyanathan ,  Gail Irene Woodland

    IPC分类号： G06F15173

    CPC分类号： H04L45/16 ,  H04L12/18 ,  H04L12/467 ,  H04L45/00 ,  H04L49/201 ,  H04L49/3009 ,  H04L49/354 ,  H04L49/602

    摘要： A multicast processor minimizes the software resource needed to process multicast protocol and broadcast protocol for bridges and routers in a network processor based environment. The multicast forwarding processor receives multicast and broadcast Layer 2/Layer 3/Layer 4 (L2/L3/L4) frames from a network processor. During reception, a frame layer flag, a unicast/multicast flag, and a frame position flag are set. A multitask forwarding table is accessed, and the frame, unicast/multicast, and frame position flags are stored and updated. The frame, unicast/multicast, and frame position flags are then sent to a frame forwarding processor. The L2/L3/L4 frames are routed to an L2 learning processor. The L2/L3/L4 frames are received from the frame forwarding processor, and the L2/L3/L4 frames are sent to an L3/L4 processor for frame header modification. The modified L2/L3/L4 frames are received from said L3/L4 processor, and the modified L2/L3/L4 frames are sent to an L2 filter processor.

    摘要翻译： 组播处理器最小化处理基于网络处理器的环境中的桥接器和路由器处理多播协议和广播协议所需的软件资源。 多播转发处理器从网络处理器接收组播和广播第2层/第3层/第4层（L2 / L3 / L4）帧。 在接收期间，设置帧层标志，单播/多播标志和帧位置标志。 访问多任务转发表，并存储和更新帧，单播/多播和帧位置标志。 然后将帧，单播/多播和帧位置标志发送到帧转发处理器。 L2 / L3 / L4帧路由到L2学习处理器。 从帧转发处理器接收L2 / L3 / L4帧，将L2 / L3 / L4帧发送到L3 / L4处理器进行帧头修改。 从L3 / L4处理器接收修改后的L2 / L3 / L4帧，将修改的L2 / L3 / L4帧发送到L2滤波处理器。

    Method and apparatus for processing frame classification information between network processors
    19.
    发明授权
    Method and apparatus for processing frame classification information between network processors 失效
    用于处理网络处理器之间帧分类信息的方法和装置

    公开(公告)号：US07106730B1

    公开(公告)日：2006-09-12

    申请号：US09546833

    申请日：2000-04-11

    申请人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Anthony Matteo Gallo ,  Marco C. Heddes ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    发明人： Brian Mitchell Bass ,  Jean Louis Calvignac ,  Anthony Matteo Gallo ,  Marco C. Heddes ,  Michael Steven Siegel ,  Fabrice Jean Verplanken

    IPC分类号： H04L12/56

    CPC分类号： H04L49/30

    摘要： A network device including an ingress processor and egress processor which receives frames of data over the network on an input port, and transfers it to an appropriate output port. The received frame is processed by an ingress processor which prepares an intra-switch frame for delivery to an egress processor serving a relevant output port of the switch. The intra-switch frame includes a frame header having parameters which have been determined by the ingress processor, as well as data indicating an address for the egress processor for beginning processing of the frame. By identifying to the egress processor processing which has already taken place, the egress processor is relieved of any redundant processing of the frame. The egress processor provides a hardware frame classifier which decodes the information contained in the intra-frame header to derive parameters which have been previously computed as well as a starting address for the egress processor. By reducing the amount of redundant processing of the egress processor, total device throughput delay is reduced.

    摘要翻译： 一种网络设备，包括入口处理器和出口处理器，其在输入端口上通过网络接收数据帧，并将其传送到适当的输出端口。 接收到的帧由入口处理器处理，入口处理器准备一个内部交换帧，用于传送到服务于交换机的相关输出端口的出口处理器。 帧内切换帧包括具有由入口处理器确定的参数的帧报头，以及指示用于开始处理该帧的出口处理器的地址的数据。 通过识别已经发生的出口处理器处理，出口处理器免除了帧的任何冗余处理。 出口处理器提供硬件帧分类器，其对包含在帧内报头中的信息进行解码以导出先前已经计算的参数以及出口处理器的起始地址。 通过减少出口处理器的冗余处理量，减少了总设备吞吐量延迟。