利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

112 条记录 (耗时 0.025 秒)

    Packet classification using modified range labels
    1.
    发明授权
    Packet classification using modified range labels 失效
    数据包分类使用修改的范围标签

    公开(公告)号：US07796513B2

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

    申请号：US12187188

    申请日：2008-08-06

    申请人： Claude Basso ,  Jean Louis Calvignac ,  Gordon Taylor Davis ,  Clark Debs Jeffries

    发明人： Claude Basso ,  Jean Louis Calvignac ,  Gordon Taylor Davis ,  Clark Debs Jeffries

    IPC分类号： H04L12/26

    CPC分类号： H04L45/00 ,  H04L12/4625 ,  H04L45/54 ,  H04L45/7453 ,  H04L63/0263

    摘要： A method and system for encoding a set of range labels for each parameter field in a packet classification key in such a way as to require preferably only a single entry per rule in a final processing stage of a packet classifier. Multiple rules are sorted accorded to their respective significance. A range, based on a parameter in the packet header, is previously determined. Multiple rules are evaluated according to an overlapping of rules according to different ranges. Upon a determination that two or more rules overlap, each overlapping rule is expanded into multiple unique segments that identify unique range intersections. Each cluster of overlapping ranges is then offset so that at least one bit in a range for the rule remains unchanged. The range segments are then converted from binary to Gray code, which results in the ability to determine a CAM entry to use for each range.

    摘要翻译： 一种方法和系统，用于以分组分类密钥中的每个参数字段的一组范围标签进行编码，以便在分组分类器的最后处理阶段中优选地仅需要每个规则仅一个条目。 根据各自的意义对多个规则进行排序。 预先确定基于分组报头中的参数的范围。 根据不同范围的规则重叠来评估多个规则。 在确定两个或更多个规则重叠时，每个重叠规则被扩展为识别唯一范围交点的多个唯一段。 然后，每个重叠范围的簇被偏移，使得该规则的范围中的至少一个位保持不变。 范围段然后从二进制转换为格雷码，这导致确定每个范围使用的CAM条目的能力。

    Packet classification using modified range labels
    2.
    发明授权
    Packet classification using modified range labels 失效
    数据包分类使用修改的范围标签

    公开(公告)号：US07466687B2

    公开(公告)日：2008-12-16

    申请号：US10425097

    申请日：2003-04-28

    申请人： Claude Basso ,  Jean Louis Calvignac ,  Gordon Taylor Davis ,  Clark Debs Jeffries

    发明人： Claude Basso ,  Jean Louis Calvignac ,  Gordon Taylor Davis ,  Clark Debs Jeffries

    IPC分类号： H04L12/28

    CPC分类号： H04L45/00 ,  H04L12/4625 ,  H04L45/54 ,  H04L45/7453 ,  H04L63/0263

    摘要： A method and system for encoding a set of range labels for each parameter field in a packet classification key in such a way as to require preferably only a single entry per rule in a final processing stage of a packet classifier. Multiple rules are sorted accorded to their respective significance. A range, based on a parameter in the packet header, is previously determined. Multiple rules are evaluated according to an overlapping of rules according to different ranges. Upon a determination that two or more rules overlap, each overlapping rule is expanded into multiple unique segments that identify unique range intersections. Each cluster of overlapping ranges is then offset so that at least one bit in a range for the rule remains unchanged. The range segments are then converted from binary to Gray code, which results in the ability to determine a CAM entry to use for each range.

    摘要翻译： 一种方法和系统，用于以分组分类密钥中的每个参数字段的一组范围标签进行编码，以便在分组分类器的最后处理阶段中优选地仅需要每个规则仅一个条目。 根据各自的意义对多个规则进行排序。 预先确定基于分组报头中的参数的范围。 根据不同范围的规则重叠来评估多个规则。 在确定两个或更多个规则重叠时，每个重叠规则被扩展为识别唯一范围交点的多个唯一段。 然后，每个重叠范围的簇被偏移，使得该规则的范围中的至少一个位保持不变。 范围段然后从二进制转换为格雷码，这导致确定每个范围使用的CAM条目的能力。

    Method and system for efficient layer 3-layer 7 routing of internet protocol (“IP”) fragments
    6.
    发明授权
    Method and system for efficient layer 3-layer 7 routing of internet protocol (“IP”) fragments 有权
    网络协议（“IP”）片段的有效层3层7路由的方法和系统

    公开(公告)号：US07065086B2

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

    申请号：US09931206

    申请日：2001-08-16

    申请人： Claude Basso ,  Jean Louis Calvignac ,  Philippe Damon ,  Gordon Taylor Davis

    发明人： Claude Basso ,  Jean Louis Calvignac ,  Philippe Damon ,  Gordon Taylor Davis

    IPC分类号： H04L12/28

    CPC分类号： H04L49/25 ,  H04L49/602

    摘要： According to the present invention there is provided to a method and system for efficiently routing IP fragments (i.e., datagrams) at layer 3 through layer 7 of the OSI model without reassembling the fragments. Time-consuming reassembly of fragments of a datagram at higher layers that would be required via conventional methods is avoided, thereby improving processing speed of fragments and utilizing fewer resources for processing fragments of a datagram than would be required during reassembly of the fragments via conventional methods. The method and system route a datagram that has been fragmented into a plurality of fragments utilizing content-based routing information included in one or more fragments of the plurality of fragments, comprising: generating a context for the datagram associated with routing the plurality of fragments of the datagram and setting the context for the datagram to passive until content-based routing information included in the one or more fragments is received; caching received fragments while the context is set to passive; determining a destination for routing the plurality of fragments when content-based routing information included in the one or more fragments is received and setting the context for the datagram to active; and routing any cached fragments and subsequently received fragments of the datagram to the determined destination while the context is active without reassembling the plurality of fragments into the datagram. Additionally, a router and server load balancer incorporating the present invention are provided.

    摘要翻译： 根据本发明，提供了一种用于在不重新组装片段的情况下有效地路由OSI模型的层3到层7的IP片段（即，数据报）的方法和系统。 避免了通过常规方法需要的较高层数据报片段的重新组装，从而提高片段的处理速度，并利用较少的资源来处理数据报的片段，而不是通过常规方法重新组装片段时所需要的数据报片段 。 所述方法和系统使用包括在所述多个片段中的一个或多个片段中的基于内容的路由信息​​将已经被分段的数据报路由到多个片段中，包括：生成与路由多个片段的多个片段相关联的数据报的上下文 数据报并将数据报的上下文设置为被动，直到接收到包含在一个或多个片段中的基于内容的路由信息​​为止; 缓存接收到的片段，同时将上下文设置为被动; 当接收到包含在所述一个或多个片段中的基于内容的路由信息​​被接收并且将所述数据报的上下文设置为活动时，确定用于路由所述多个片段的目的地; 并且在上下文是活动的情况下将任何高速缓存的分段和随后接收的数据报的片段路由到所确定的目的地，而不将多个片段重新组合到数据报中。 另外，提供并入本发明的路由器和服务器负载均衡器。

    Software management tree implementation for a network processor
    7.
    发明授权
    Software management tree implementation for a network processor 失效
    网络处理器的软件管理树实现

    公开(公告)号：US07107265B1

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

    申请号：US09545100

    申请日：2000-04-06

    申请人： Jean Louis Calvignac ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi

    发明人： Jean Louis Calvignac ,  Marco C. Heddes ,  Clark Debs Jeffries ,  Piyush Chunilal Patel ,  Mark Anthony Rinaldi

    IPC分类号： G06F17/30 ,  G06F15/00 ,  G06F9/44

    CPC分类号： H04L45/742 ,  G06F17/30961 ,  G06F17/30985 ,  Y10S707/99933 ,  Y10S707/99936 ,  Y10S707/99937

    摘要： Novel data structures, methods and apparatus for a Software Managed Tree (SMT) which provides a mechanism to create tree structures that follow a search mechanism defined by a control point processor. The search mechanism does not require storage on the previous pointer and uses only a forward pointer along with a next bit or group of bits to test thereby reducing storage space for nodes. The search mechanism processes multiple filter rules for an application without requiring multiple searches and also allows various filter rules to be chained. Two patterns of the same length are stored in each leaf to define a range compare. A compare at the end operation is either a compare under range or a compare under mask. In a compare under range, the input key is checked to determine if it is in the range defined by the two patterns. In a compare under mask, the bits in the input key are compared with the bits in a first leaf pattern under a mask specified in a second leaf pattern.

    摘要翻译： 用于软件管理树（SMT）的新型数据结构，方法和装置，其提供了一种机制，用于创建遵循由控制点处理器定义的搜索机制的树结构。 搜索机制不需要在前一个指针上存储，并且仅使用前向指针以及下一个位或一组位来进行测试，从而减少节点的存储空间。 搜索机制处理应用程序的多个过滤器规则，而不需要多次搜索，并且还允许链接各种过滤器规则。 在每个叶中存储相同长度的两个图案以定义范围比较。 在最终操作中的比较是在范围之下的比较或掩码下的比较。 在范围比较范围内，检查输入键以确定是否在两种模式定义的范围内。 在掩码下的比较中，将输入密钥中的比特与在第二叶图案中指定的掩码下的第一叶图案中的比特进行比较。

    Cyclic redundancy check for partitioned frames
    8.
    发明授权
    Cyclic redundancy check for partitioned frames 失效
    分区帧的循环冗余校验

    公开(公告)号：US06681364B1

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

    申请号：US09405669

    申请日：1999-09-24

    申请人： Jean Louis Calvignac ,  Clark Debs Jeffries ,  Fabrice Jean Verplanken

    发明人： Jean Louis Calvignac ,  Clark Debs Jeffries ,  Fabrice Jean Verplanken

    IPC分类号： H03M1300

    CPC分类号： H04L1/0061 ,  H03M13/091 ,  H04L1/0071 ,  H04L1/0072

    摘要： An improved method and system for generating a frame check sequence. A multiple-bit data string, M, is received in which M is of the form: anbncndnan−1bn−1cn−1dn−1 . . . a2b2c2d2a1b1c1d1. M is thereafter parsed into multiple subframes of the form: anan−1an−2 . . . a2a1; bnbn−1bn−2 . . . b2b1; cncn−1cn−2 . . . c2c1; and dndn−1dn−2 . . . d2d1. The subframes are padded with zeros resulting in subframes of the form: an000an−1000an−2000 . . . a2000a1000; 0bn000bn−1000bn−200 . . . 0b2000b100; 00cn000cn−1000cn−20 . . . 00c2000c100; and 000dn000dn−1000dn−2 . . . 000d2000d1. A partial check sum is then generated for each of the multiple subframes. Finally, each of the partial check sums are added together such that a frame check sequence for M is obtained.

    摘要翻译： 一种用于生成帧校验序列的改进的方法和系统。 接收多位数据串M，其中M具有以下形式：M随后被解析为形式的多个子帧：并且子帧用零填充，产生以下形式的子帧：然后生成部分校验和 对于多个子帧中的每一个。 最后，将每个部分校验和相加在一起，从而获得用于M的帧校验序列。