US6081812A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Identifying at-risk components in systems with redundant components
Assignee: Teradata US Inc
•
Filing: 1998-02-06
•
Granted: 2000-06-27
•
Expires: 2018-02-06
Abstract
Abstract A method and apparatus for identifying at-risk data in systems with redundant components is described. The method comprises the steps of representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading into the node, decrementing the path count for each node by one, for each failure of a path leading to the node, decrementing the path count for each node by one, for every path leading from each node having a zero path count, decrementing the path count for each node by one, for every path leading from a failed node, and presenting a graphical depiction of the nodes and the paths to a user.
Inventors
- 👤 Gary Lee Boggs
- 👤 John D. Frazier
- 👤 Gregory D. Bruno
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 20:08
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/30; G06F11/32; G06F11/324; G06F11/328; G06F11/008; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99943; Y10S707/99951; Y10S707/99952; Y10S707/99953
Claims Analysis
Total Claims: 57
Claim 1
Independent Claim
142 words
A method for identifying at-risk data stored in a data storage system, comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; presenting a graphical depiction of the nodes and the paths to a user; designating nodes with a path count below a designated value to be at risk.
Claim 2
Independent Claim
142 words
A method for identifying at-risk data stored in a data storage system, comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; presenting a graphical depiction of the nodes and the paths to a user; designating nodes with a path count below a designated value to be at risk.
Claim 3
Dependent Claim
54 words
The method of claim 1, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of designating the end node at risk when a node is on all paths from the start node to the end node.
Claim 4
Dependent Claim
107 words
The method of claim 1, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of: generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; incrementing a first counter associated with the start node and the end node for every search path; incrementing a second counter for each node along the search; and designating an end node at risk when the first counter and the second counter are equal.
Claim 5
Dependent Claim
28 words
The method of claim 3, further comprising the step of identifying a node as a single point of failure for every node that is in all search paths.
Claim 6
Dependent Claim
27 words
The method of claim 1, further comprising the steps of finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 7
Dependent Claim
126 words
The method of claim 1, further comprising the steps of: (a) accepting a selection for a candidate node to be designated as out of service; (b) deleting the candidate node; (c) decrementing the path count for each node by one, for every path leading to the node from the candidate node; (d) deleting any node for which the path count equals zero; (e) decrementing the path count for each node by one, for every path leading to the node from the deleted node; (f) repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) designating nodes with a path count below a designated value to be at risk; and (h) designating nodes with a zero path count to be inaccessible.
Claim 8
Dependent Claim
31 words
The method of claim 6, further comprising the steps of: identifying articulation nodes representing single point of failure nodes; and designating nodes reachable from the articulation nodes as at risk nodes.
Claim 9
Dependent Claim
78 words
The method of claim 7, further comprising the steps of: allowing a user to proceed if no nodes are designated at risk or inaccessible; designating inaccessible nodes as inaccessible-in use when the nodes are in use; preventing the user from proceeding if a node is designated inaccessible-in use; presenting a first warning message to the user when a node is designated inaccessible; and presenting a second warning message to the user when a node is designated at risk.
Claim 10
Dependent Claim
167 words
A program storage device, readable by a computer, tangibly embodying one or more programs of instructions executable by the computer to perform method steps of identifying at-risk data stored in a data storage system, the method comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; presenting a graphical depiction of the nodes and the paths to a user; and designating nodes with a path count below a designated value to be at risk.
Claim 11
Dependent Claim
167 words
A program storage device, readable by a computer, tangibly embodying one or more programs of instructions executable by the computer to perform method steps of identifying at-risk data stored in a data storage system, the method comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; presenting a graphical depiction of the nodes and the paths to a user; and designating nodes with a path count below a designated value to be at risk.
Claim 12
Dependent Claim
60 words
The program storage device of claim 9, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of designating the end node at risk when a node which is on all paths from the start node to the end node is at risk.
Claim 13
Dependent Claim
110 words
The program storage device of claim 9, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method steps further comprises the steps of: generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; incrementing a first counter associated with the start node and the end node for every search path; incrementing a second counter for each node along the search; and designating an end node at risk when the first counter and the second counter are equal.
Claim 14
Dependent Claim
34 words
The program storage device of claim 11, wherein the method steps further comprise the step of identifying a node as a single point of failure for every node that is in all search paths.
Claim 15
Dependent Claim
32 words
The program storage device of claim 9, wherein the method further comprises the steps of finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 16
Dependent Claim
132 words
The program storage device of claim 9, wherein the method steps further comprises the steps of: (a) accepting a selection for a candidate node to be designated as out of service; (b) deleting the candidate node; (c) decrementing the path count for each node by one, for every path leading to the node from the candidate node; (d) deleting any node for which the path count equals zero; (e) decrementing the path count for each node by one, for every path leading to the node from the deleted node; (f) repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) designating nodes with a path count below a designated value to be at risk; and (h) designating nodes with a zero path count to be inaccessible.
Claim 17
Dependent Claim
37 words
The program storage device of claim 14, wherein the method steps further comprise the steps of: identifying articulation nodes representing single point of failure nodes; and designating nodes reachable from the articulation nodes as at risk nodes.
Claim 18
Dependent Claim
84 words
The program storage device of claim 15, wherein the method steps further comprise the steps of: allowing a user to proceed if no nodes are designated at risk or inaccessible; designating inaccessible nodes as inaccessible-in use when the nodes are in use; preventing the user from proceeding if a node is designated inaccessible-in use; presenting a first warning message to the user when a node is designated inaccessible; and presenting a second warning message to the user when a node is designated at risk.
Claim 19
Independent Claim
152 words
An apparatus for identifying at-risk data stored in a data storage system, comprising: means for representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; means for decrementing the path count for each node by one, for each failure of a path leading to the node; means for decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; means for decrementing the path count for each node by one for every path leading to the node from a failed node; means for presenting a graphical depiction of the nodes and the paths to a user; and means for designating nodes with a path count below a designated value to be at risk.
Claim 20
Independent Claim
152 words
An apparatus for identifying at-risk data stored in a data storage system, comprising: means for representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; means for decrementing the path count for each node by one, for each failure of a path leading to the node; means for decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; means for decrementing the path count for each node by one for every path leading to the node from a failed node; means for presenting a graphical depiction of the nodes and the paths to a user; and means for designating nodes with a path count below a designated value to be at risk.
Claim 21
Dependent Claim
57 words
The apparatus of claim 17, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the apparatus further comprises means for designating the end node at risk when a node which is on all paths from the start node to the end node is at risk.
Claim 22
Dependent Claim
111 words
The apparatus of claim 17, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the apparatus further comprises: means for generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; means for incrementing a first counter associated with the start node and the end node for every search path; means for incrementing a second counter for each node along the search paths; and designating an end node at risk when the first counter and the second counter are equal.
Claim 23
Dependent Claim
27 words
The apparatus of claim 19, further comprising means for identifying a node as a single point of failure for every node that is in all search paths.
Claim 24
Dependent Claim
26 words
The apparatus of claim 17, further comprising means for finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 25
Dependent Claim
157 words
The apparatus of claim 17, wherein the nodes comprise a plurality of volume set nodes, component nodes, and compute nodes, and the apparatus further comprises (a) means for accepting a selection for a candidate node to be designated as out of service; (b) means for deleting the candidate node; (c) means for decrementing the path count for each node by one for every path leading to the node from the candidate node; (d) means for deleting any node for which the path count equals zero; (e) means for decrementing the path count for each node by one for every path leading to the node from the deleted node; (f) means for repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) means for designating nodes with a path count below a designated value to be at risk; and (h) means for designating nodes with a zero path count to be inaccessible.
Claim 26
Dependent Claim
32 words
The apparatus of claim 22, further comprising: means for identifying articulation nodes representing single point of failure nodes; and means for designating nodes reachable from the articulation nodes as at risk nodes.
Claim 27
Dependent Claim
85 words
The apparatus of claim 23, further comprising: means for allowing a user to proceed if no nodes are designated at risk or inaccessible; means for designating inaccessible nodes as inaccessible-in use when the nodes are in use; means for preventing the user from proceeding if a node is designated inaccessible-in use; means for presenting a first warning message to the user when a node is designated inaccessible; and means for presenting a second warning message to the user when a node is designated at risk.
Claim 28
Independent Claim
130 words
A method for depicting a data storage system, comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; and presenting a depiction of the nodes, the path count for each node, and the paths to a user.
Claim 29
Independent Claim
130 words
A method for depicting a data storage system, comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; and presenting a depiction of the nodes, the path count for each node, and the paths to a user.
Claim 30
Dependent Claim
24 words
The method of claim 25, further comprising the step of designating nodes with a path count below a designated value to be at risk.
Claim 31
Dependent Claim
54 words
The method of claim 26, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of designating the end node at risk when a node is on all paths from the start node to the end node.
Claim 32
Dependent Claim
107 words
The method of claim 26, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of: generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; incrementing a first counter associated with the start node and the end node for every search path; incrementing a second counter for each node along the search; and designating an end node at risk when the first counter and the second counter are equal.
Claim 33
Dependent Claim
28 words
The method of claim 28, further comprising the step of identifying a node as a single point of failure for every node that is in all search paths.
Claim 34
Dependent Claim
27 words
The method of claim 26, further comprising the steps of finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 35
Dependent Claim
126 words
The method of claim 25, further comprising the steps of: (a) accepting a selection for a candidate node to be designated as out of service; (b) deleting the candidate node; (c) decrementing the path count for each node by one, for every path leading to the node from the candidate node; (d) deleting any node for which the path count equals zero; (e) decrementing the path count for each node by one, for every path leading to the node from the deleted node; (f) repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) designating nodes with a path count below a designated value to be at risk; and (h) designating nodes with a zero path count to be inaccessible.
Claim 36
Dependent Claim
31 words
The method of claim 31, further comprising the steps of: identifying articulation nodes representing single point of failure nodes; and designating nodes reachable from the articulation nodes as at risk nodes.
Claim 37
Dependent Claim
78 words
The method of claim 32, further comprising the steps of: allowing a user to proceed if no nodes are designated at risk or inaccessible; designating inaccessible nodes as inaccessible-in use when the nodes are in use; preventing the user from proceeding if a node is designated inaccessible-in use; presenting a first warning message to the user when a node is designated inaccessible; and presenting a second warning message to the user when a node is designated at risk.
Claim 38
Dependent Claim
154 words
A program storage device, readable by a computer, tangibly embodying one or more programs of instructions executable by the computer to perform method steps of depicting a data storage system, the method comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; and presenting a depiction of the nodes, the path count for each node, and the paths to a user.
Claim 39
Dependent Claim
154 words
A program storage device, readable by a computer, tangibly embodying one or more programs of instructions executable by the computer to perform method steps of depicting a data storage system, the method comprising the steps of: representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; decrementing the path count for each node by one for each failure of a path leading to the node; decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; decrementing the path count for each node by one for every path leading to the node from a failed node; and presenting a depiction of the nodes, the path count for each node, and the paths to a user.
Claim 40
Dependent Claim
29 words
The program storage device of claim 34, wherein the method further comprises the steps of designating nodes with a path count below a designated value to be at risk.
Claim 41
Dependent Claim
60 words
The program storage device of claim 35, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method further comprises the steps of designating the end node at risk when a node which is on all paths from the start node to the end node is at risk.
Claim 42
Dependent Claim
110 words
The program storage device of claim 35, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the method steps further comprises the steps of: generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; incrementing a first counter associated with the start node and the end node for every search path; incrementing a second counter for each node along the search; and designating an end node at risk when the first counter and the second counter are equal.
Claim 43
Dependent Claim
34 words
The program storage device of claim 37, wherein the method steps further comprise the step of identifying a node as a single point of failure for every node that is in all search paths.
Claim 44
Dependent Claim
32 words
The program storage device of claim 35, wherein the method further comprises the steps of finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 45
Dependent Claim
132 words
The program storage device of claim 34, wherein the method steps further comprises the steps of: (a) accepting a selection for a candidate node to be designated as out of service; (b) deleting the candidate node; (c) decrementing the path count for each node by one, for every path leading to the node from the candidate node; (d) deleting any node for which the path count equals zero; (e) decrementing the path count for each node by one, for every path leading to the node from the deleted node; (f) repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) designating nodes with a path count below a designated value to be at risk; and (h) designating nodes with a zero path count to be inaccessible.
Claim 46
Dependent Claim
37 words
The program storage device of claim 40, wherein the method steps further comprise the steps of: identifying articulation nodes representing single point of failure nodes; and designating nodes reachable from the articulation nodes as at risk nodes.
Claim 47
Dependent Claim
84 words
The program storage device of claim 41, wherein the method steps further comprise the steps of: allowing a user to proceed if no nodes are designated at risk or inaccessible; designating inaccessible nodes as inaccessible-in use when the nodes are in use; preventing the user from proceeding if a node is designated inaccessible-in use; presenting a first warning message to the user when a node is designated inaccessible; and presenting a second warning message to the user when a node is designated at risk.
Claim 48
Independent Claim
142 words
An apparatus for identifying at-risk data stored in a data storage system, comprising: means for representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; means for decrementing the path count for each node by one, for each failure of a path leading to the node; means for decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; means for decrementing the path count for each node by one for every path leading to the node from a failed node; and means for presenting a graphical depiction of the nodes, the path count for each node, and the paths to a user.
Claim 49
Independent Claim
142 words
An apparatus for identifying at-risk data stored in a data storage system, comprising: means for representing the system by a plurality of nodes representing components and a plurality of paths representing communication paths among the components, each node having a path count representing the number of paths leading to the node; means for decrementing the path count for each node by one, for each failure of a path leading to the node; means for decrementing the path count for each node by one for every path leading to the node from each node having a zero path count; means for decrementing the path count for each node by one for every path leading to the node from a failed node; and means for presenting a graphical depiction of the nodes, the path count for each node, and the paths to a user.
Claim 50
Dependent Claim
23 words
The apparatus of claim 43, further comprising means for designating nodes with a path count below a designated value to be at risk.
Claim 51
Dependent Claim
57 words
The apparatus of claim 44, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the apparatus further comprises means for designating the end node at risk when a node which is on all paths from the start node to the end node is at risk.
Claim 52
Dependent Claim
111 words
The apparatus of claim 44, wherein the plurality of nodes comprises a start node and an end node, the end node representing a data volume, and the apparatus further comprises: means for generating a set of search paths from the start node to the end node, the search paths comprising every combination of paths from the start node to the end node; means for incrementing a first counter associated with the start node and the end node for every search path; means for incrementing a second counter for each node along the search paths; and designating an end node at risk when the first counter and the second counter are equal.
Claim 53
Dependent Claim
27 words
The apparatus of claim 46, further comprising means for identifying a node as a single point of failure for every node that is in all search paths.
Claim 54
Dependent Claim
26 words
The apparatus of claim 44, further comprising means for finding articulation nodes representing single-point of failure nodes and reporting the articulation nodes in the graphical depiction.
Claim 55
Dependent Claim
157 words
The apparatus of claim 43, wherein the nodes comprise a plurality of volume set nodes, component nodes, and compute nodes, and the apparatus further comprises (a) means for accepting a selection for a candidate node to be designated as out of service; (b) means for deleting the candidate node; (c) means for decrementing the path count for each node by one for every path leading to the node from the candidate node; (d) means for deleting any node for which the path count equals zero; (e) means for decrementing the path count for each node by one for every path leading to the node from the deleted node; (f) means for repeating steps (d) and (e) until all nodes have a path count greater than zero; (g) means for designating nodes with a path count below a designated value to be at risk; and (h) means for designating nodes with a zero path count to be inaccessible.
Claim 56
Dependent Claim
32 words
The apparatus of claim 49, further comprising: means for identifying articulation nodes representing single point of failure nodes; and means for designating nodes reachable from the articulation nodes as at risk nodes.
Claim 57
Dependent Claim
85 words
The apparatus of claim 50, further comprising: means for allowing a user to proceed if no nodes are designated at risk or inaccessible; means for designating inaccessible nodes as inaccessible-in use when the nodes are in use; means for preventing the user from proceeding if a node is designated inaccessible-in use; means for presenting a first warning message to the user when a node is designated inaccessible; and means for presenting a second warning message to the user when a node is designated at risk.
References Cited (Backward Citations)
US5014192A
Cited
US5202985A
Cited
WO1992005485A2
Cited
WO1992014207A1
Cited
US5522046A
Cited
US5398334A
Cited
US5500940A
Cited
US5630125A
Cited
US5581694A
Cited
US5699403A
Cited
US5917730A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-06-27 | 2003-12-27 | 2004-06-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-06-27 | 2007-12-27 | 2008-06-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-06-27 | 2011-12-27 | 2012-06-27 | $7700.00 | Window Closed / Lapsed |