Method for filter selection and array matching
OwnerKiril Koganinventor
Life of this patent
Estimating the term…
Abstract
A communications network having a multi-staged data filter system for selecting and matching filters to the information flow. The multi-staged data filter system operates to handle information flow by matching attributes of the information with filter arrays, by conducting a search in accordance with binary tree algorithm, said binary tree constructed from a policy table containing a list of related filter arrays arranged in a particular sequence.
Claims14
A multi-stage, machine-implemented method for enabling the handling of information flow for classification purposes, by automated selection of the optimally-matched filter including arrays from among a collection of filters in a communications network wherein each filter contains at least two fields, a first field having a plurality of input data, and a second field having a plurality of output data, said method comprising matching attributes of said information with said filter arrays by conducting a search of said collection of filters in accordance with a binary tree algorithm having a minimum of two binary trees, said binary tree algorithm being constructed from a policy table containing a list of related filter arrays arranged in a particular sequence stored in the binary tree nodes, said method proceeding by only one traversal over each binary tree.
(Deleted)
A method for filter selection and array matching for handling information flow for classification purposes, comprising the steps of:
- i) choosing at least two fields from a list of fields associated with arrays stored in a filter database table;
- ii) building two binary trees based on arrays stored in said filter database table, a first binary tree for a source field array and a second binary tree for a destination field array;
- iii) storing said arrays of said filters in a suitable node in said binary trees with a pointer for every said node which points to its corresponding array in said parallel binary tree;
- iv) traversing a first path along said first binary tree with a source field array of the information flow until the last binary tree node is reached;
- v) marking all said traversed nodes of said first binary tree during said one-time traversal;
- vi) traversing a second path along said second binary tree with a destination field array of said information flow until the last binary tree node is reached;
- vii) marking all of said traversed nodes of said second binary tree during said one-time traversal;
- viii) initializing a list of filters having pointers originating along said second path that reached a marked node in said first binary tree;
- ix) adding to said list, filters having pointers originating along said first path that reach a marked node in said second binary tree;
- and
- x) arranging said listed filters according to any selectable criteria;
- and
- xi) comparing said listed filters to the information flow by any kind of method.
Dependencies are inferred from the claim text.