Method and system for performing interval-based testing of filter rules
    112.
    发明授权
    Method and system for performing interval-based testing of filter rules 失效
    用于执行过滤器规则的基于间隔的测试的方法和系统

    公开(公告)号:US06539394B1

    公开(公告)日:2003-03-25

    申请号:US09477578

    申请日:2000-01-04

    IPC分类号: G06F1730

    摘要: A method and system for testing a plurality of filter rules in a computer system is disclosed. The plurality of filter rules uses at least one range of values in at least one dimension. Each range includes a minimum and a maximum value. The filter rules are used with a key. The method and system include reducing an amount of testing required based on the minimum and maximum value of each range to ensure that the key can match a portion of the filter rules and testing the key against the portion of the filter rules. In one aspect, the method and system include determining at least one subset of filter rules and testing the key against each subset to determine whether the key matches a filter rule of a subset. The subset of filter rules is non-intersecting in at least a second dimension and is based on the minimum value and the maximum value of each range in the second dimension. In another aspect, the method and system include providing at least one bit for each interval set of a plurality of interval sets and providing a decision tree for the filter rules based on the interval sets. The bit characterizes each interval set. The decision tree includes leaf paths having at least one node and is for isolating a portion of the plurality of filter rules on a leaf path. Each node of the decision tree utilizes a bit of the at least one bit.

    摘要翻译: 公开了一种用于测试计算机系统中的多个过滤规则的方法和系统。 多个过滤器规则使用至少一个维度中的至少一个值范围。 每个范围包括最小值和最大值。 过滤器规则与密钥一起使用。 该方法和系统包括基于每个范围的最小值和最大值来减少所需的测试量,以确保密钥可以匹配一部分过滤规则并根据过滤器规则的部分测试密钥。 在一个方面,所述方法和系统包括确定过滤器规则的至少一个子集并且针对每个子集测试该密钥以确定密钥是否匹配子集的过滤规则。 滤波器规则的子集在至少第二维度上是不相交的,并且基于第二维度中每个范围的最小值和最大值。 在另一方面,所述方法和系统包括为多个间隔集合的每个间隔集合提供至少一个比特,并且基于所述间隔集合为所述过滤规则提供决策树。 该位表征每个间隔集。 决策树包括具有至少一个节点的叶路径,并且用于隔离叶路径上的多个过滤规则的一部分。 决策树的每个节点都使用至少一位的位。