会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Rule set verification
    • 规则集验证
    • US07760730B2
    • 2010-07-20
    • US10868556
    • 2004-06-15
    • Jason L. GoldschmidtChristoph L. SchubaMichael F. Speer
    • Jason L. GoldschmidtChristoph L. SchubaMichael F. Speer
    • H04L12/28
    • H04L41/0869H04L41/0823H04L41/0879H04L41/5009H04L41/5022H04L41/5093
    • A flow manager may receive prioritized packet flow rules from one or more network services where each rule may include a packet filter and prioritized actions. Each action of a packet flow rule may be either terminating or non-terminating. A flow manager may generate a unified rule set according to the received packet flow rules and may additionally validate the unified rule set to identity errors. When validating the unified rule set, a flow manager may compare the unified rule set against one or more defined policies. Alternatively, a flow manager may apply the unified rule set to either captured or manually specified simulated network packets. A flow manager may also identity extraneous rules or actions. Further, a flow manager may present the unified rule set for manual verification and may receive input identifying errors and specifying modification to correct the errors.
    • 流管理器可以从一个或多个网络服务接收优先级分组流规则,其中每个规则可以包括分组过滤器和优先化动作。 分组流规则的每个动作可以是终止或非终止。 流管理器可以根据接收到的分组流规则生成统一的规则集,并且可以另外验证统一规则集以识别错误。 当验证统一规则集时,流管理器可以将统一规则集与一个或多个定义的策略进行比较。 或者,流管理器可以将统一规则集应用于捕获的或手动指定的模拟网络分组。 流程管理器还可以标识无关规则或动作。 此外,流管理器可以呈现用于手动验证的统一规则集,并且可以接收输入识别错误并指定修改以校正错误。
    • 3. 发明授权
    • Method and apparatus for fast and scalable matching of structured data streams
    • 用于结构化数据流的快速和可扩展匹配的方法和装置
    • US07865608B1
    • 2011-01-04
    • US11040714
    • 2005-01-21
    • Christoph L. SchubaSumantra R. KunduJason L. Goldschmidt
    • Christoph L. SchubaSumantra R. KunduJason L. Goldschmidt
    • G06F15/16
    • H04L45/745H04L43/026H04L45/00H04L63/0227
    • One embodiment of the present invention provides a system that classifies elements in a structured data stream. Upon receiving an element from the structured data stream, the system applies a hash function to the element to generate a single hash value. Next, the system divides the single hash value into multiple sections, and uses the multiple sections as inputs to a Bloom filter to determine if a node for the element exists in an associated lookup structure. If so, the system looks up the node for the element in the associated lookup structure. Note that using the Bloom filter in this way prevents unnecessary lookups. Furthermore, using multiple sections of a single hash value as inputs to the Bloom filter eliminates the need to compute multiple hash values.
    • 本发明的一个实施例提供了一种对结构化数据流中的元素进行分类的系统。 在从结构化数据流接收到元素时,系统将该哈希函数应用于该元素以生成单个哈希值。 接下来,系统将单个哈希值分为多个部分,并将多个部分用作Bloom过滤器的输入,以确定元素的节点是否存在于相关联的查找结构中。 如果是这样,系统将在关联的查找结构中查找元素的节点。 请注意,以这种方式使用Bloom过滤器可以防止不必要的查找。 此外,使用单个散列值的多个部分作为Bloom过滤器的输入消除了计算多个散列值的需要。
    • 4. 发明授权
    • Rule set conflict resolution
    • 规则集冲突解决
    • US07505463B2
    • 2009-03-17
    • US10868474
    • 2004-06-15
    • Christoph L. SchubaJason L. Goldschmidt
    • Christoph L. SchubaJason L. Goldschmidt
    • H04L12/28
    • G06N5/025H04L47/10H04L47/20H04L47/2441
    • A flow manager may receive prioritized packet flow rules from multiple prioritized network services where each flow rule may comprise a packet filter and a prioritized action list. The priority for the flow rules from each network service may be expressed as either longest prefix or ordered precedence. The flow manager may generate a unified rule set according to the received packet flow rules by identifying conflict between pairs of rules and resolving the identified conflicts according the priority relationship two rules of each pair. When resolving conflicts between rules, the flow manager may append the action list of one rule to the action list of another rule, and may also create a new rule by combining the packet filters and actions lists of the conflicting rules.
    • 流管理器可以从多个优先级网络服务接收优先级分组流规则,其中每个流规则可以包括分组过滤器和优先化动作列表。 来自每个网络服务的流规则的优先级可以表示为最长前缀或排序优先级。 流管理器可以通过识别规则对之间的冲突来根据接收到的分组流规则来生成统一的规则集,并根据每对的优先级关系来解决所识别的冲突。 当解决规则之间的冲突时,流程管理器可以将一个规则的操作列表附加到另一个规则的操作列表中,并且还可以通过组合冲突规则的分组过滤器和动作列表来创建新规则。
    • 7. 发明授权
    • Flow based reply cache
    • 基于流的回复缓存
    • US08621154B1
    • 2013-12-31
    • US12105914
    • 2008-04-18
    • Jason L. GoldschmidtPeter D. ShahThomas M. Talpey
    • Jason L. GoldschmidtPeter D. ShahThomas M. Talpey
    • G06F12/00G06F13/00G06F13/28G06F17/30
    • G06F17/30097G06F12/0806G06F12/123G06F17/3033G06F2212/6042
    • A flow based reply cache of a storage system is illustratively organized into one or more microcaches, each having a plurality of reply cache entries. Each microcache is maintained by a protocol server executing on the storage system and is allocated on a per client basis. To that end, each client is identified by a client connection or logical “data flow” and is allocated its own microcache and associated entries, as needed. As a result, each microcache of the reply cache may be used to identify a logical stream of client requests associated with a data flow, as well as to isolate that client stream from other client streams and associated data flows used to deliver other requests served by the system. The use of microcaches thus provides a level of granularity that enables each client to have its own pool of reply cache entries that is not shared with other clients, thereby obviating starvation of entries allocated to the client in the reply cache.
    • 存储系统的基于流的应答缓存被示意性地组织成一个或多个微存储器,每个微存储器具有多个应答高速缓存条目。 每个微型缓存由在存储系统上执行的协议服务器维护,并以每个客户端为基础进行分配。 为此,每个客户端都由客户端连接或逻辑“数据流”标识,并根据需要分配其自己的微型缓存和相关联的条目。 因此,应答缓存的每个微缓存可以用于识别与数据流相关联的客户端请求的逻辑流,并且将该客户端流与其他客户端流和相关联的数据流隔离,用于传递由 系统。 因此,微卡的使用提供了一个粒度级别,其使得每个客户端具有其不与其他客户端共享的其自己的回复缓存条目池,从而避免在回复高速缓存中分配给客户端的条目的饥饿。
    • 8. 发明授权
    • System and method for managing a flow based reply cache
    • 用于管理基于流的应答缓存的系统和方法
    • US08171227B1
    • 2012-05-01
    • US12401993
    • 2009-03-11
    • Jason L. GoldschmidtPeter D. ShahThomas M. Talpey
    • Jason L. GoldschmidtPeter D. ShahThomas M. Talpey
    • G06F13/00
    • H04L67/2852
    • A system and method determines when the entries of a reply cache, organized into microcaches each of which is allocated to a client connection, may be retired or released, thereby freeing up memory structures. A plurality of connection statistics are defined and tracked for each microcache and for the entries of the microcache. The connection statistics indicate the value of the microcache and its entries to the client. The connection statistics include a measure of the time since the last idempotent or non-idempotent request (TOLR) was received, and a count of the number of idempotent requests that have been received since the last non-idempotent request (RISLR). A microcache with a TOLR time and a RISLR count that exceed respective thresholds may be expired and removed from the reply cache.
    • 系统和方法确定何时可以将组织成每个分配给客户端连接的微存储器的应答高速缓存的条目退出或释放,由此释放存储器结构。 为每个微型缓存和微型缓存的条目定义和跟踪多个连接统计信息。 连接统计信息指示微型缓存及其到客户端的条目的值。 连接统计信息包括自从接收到最后一个幂等或非幂等请求(TOLR)以来的时间的度量以及自上次非幂等请求(RISLR)以来已经接收到的幂等请求数的计数。 具有超过相应阈值的TOLR时间和RISLR计数的微型缓存可能会从应答缓存中过期并被移除。