US6320848B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Methods of altering dynamic decision trees
Assignee: Hewlett Packard Development Co LP
•
Filing: 1999-04-30
•
Granted: 2001-11-20
•
Expires: 2019-04-30
Abstract
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.
Inventors
- 👤 Aled Justin Edwards
- 👤 Costas Calamvokis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:23
CPC Classifications
H; H04; H04L; H04L45/00; H04L43/00; H04Q; H04Q3/00; H04Q3/64; H04Q3/66; H04L43/08; H04L43/0805; H04L43/0817; H04L43/12; H04Q2213/00; H04Q2213/13056; H04Q2213/13109; H04Q2213/13196
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
134 words
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.
Claim 2
Independent Claim
134 words
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.
Claim 3
Dependent Claim
15 words
The method of claim 1 , including the step of: (f) removing every temporary node.
Claim 4
Dependent Claim
26 words
The method of claim 1 , including the step of: (g) removing any node contained in said first configuration which is redundant in said second configuration.
Claim 5
Dependent Claim
42 words
The method of claim 3 , wherein a count is maintained in respect of the number of paths along which each node in the tree can be reached, and a node is considered to be redundant if its respective count is zero.
Claim 6
Dependent Claim
36 words
The method of claim 1 , wherein the state of every temporary node is dependent upon a common control value, and the state of every temporary node is simultaneously altered by changing said common control value.
Claim 7
Dependent Claim
25 words
The method of claim 1 , wherein the dynamic decision tree is part of a switch for switching data packets in a data communications network.
Claim 8
Dependent Claim
26 words
The method of claim 1 , wherein the dynamic decision tree is part of a probe for passive monitoring of operation of a data communications network.
References Cited (Backward Citations)
US4499596A
Cited
US5574910A
Cited
WO1994015305A1
Cited
US5666481A
Cited
US5509006A
Cited
US6018524A
Cited
US6192051B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-11-19 | 2005-05-21 | 2005-11-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-11-19 | 2009-05-21 | 2009-11-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-11-19 | 2013-05-21 | 2013-11-20 | $7700.00 | Window Closed / Lapsed |