Methods of altering dynamic decision trees
AssigneeHewlett-Packard Company
InventorsAled Justin Edwards, Costas Calamvokis
Life of this patent
Estimating the term…
Abstract
A data packet switch includes a decision tree for classifying data packets, which can be dynamically modified. To conserve memory resources nodes which are found during modification to have matching effects are combined. If only a subset of paths to a node are relevant to a modification, the node is split. Prior to implementation of the modifications, temporary nodes are inserted before modified nodes to preserve existing paths. These temporary nodes are controlled by a single memory value which can be changed to effect all the modifications to the decision tree simultaneously.
Claims7
A method of altering a dynamic decision tree containing nodes from a first node configuration to a second node configuration, comprising the steps of:
- (a) identifying a location in the decision tree at which at least one new node is to be inserted;
- (b) inserting at that point a temporary node which has first and second states, the first state keeping the existing configuration of the tree unchanged, and the temporary node initially being in said first state;
- (c) inserting said new node to depend from said temporary node and being coupled into said tree only when said temporary node is in said second state;
- (d) repeating steps (a), (b) and (c) for any additional new nodes to be inserted;
- and
- (e) simultaneously altering every temporary node from its first to its second state.
Dependencies are inferred from the claim text.