Impact propagation in a directed acyclic graph
First Claim
1. A service model impact propagation method, comprising:
- creating a data structure of a service impact model, the data structure having nodes representing components of the service impact model and having impact relationships between at least some of the nodes, each of the nodes having one of at least two states, wherein the at least two states are respectively indicative of at least two operational statuses for their respective node;
associating one or more counts with at least some of the nodes, each count of the one or more counts for a given one of the nodes representing a number of the nodes having impact relationships with the given node with a respective one of the at least two states, wherein each state of the at least two states comprises one of a respective discrete operational status, a respective range of percentage availability or a respective range of throughput levels;
changing a state of a first of the nodes;
propagating impact of the change to counts associated with one or more second nodes having impact relationships with the first node to reflect the change of the state of the first node; and
determining a state of the one or more second nodes with the counts.
11 Assignments
0 Petitions
Accused Products
Abstract
A method, system and medium for efficiently propagating service impact data in a directed acyclic graph. One or more service components, impact rules and business rules will be grouped together into a directed acyclic graph and a related metadata array. Impact propagation uses related metadata array to minimize traversal of the graph. As nodes of the graph are updated to propagate impact data a determination is made as to when no further impact propagation is required and calculations are terminated without having to traverse the entire graph. This method will allow a system or business administrator to maintain real-time notification and visualization of, the impacted state of all objects in the graph.
-
Citations
25 Claims
-
1. A service model impact propagation method, comprising:
-
creating a data structure of a service impact model, the data structure having nodes representing components of the service impact model and having impact relationships between at least some of the nodes, each of the nodes having one of at least two states, wherein the at least two states are respectively indicative of at least two operational statuses for their respective node; associating one or more counts with at least some of the nodes, each count of the one or more counts for a given one of the nodes representing a number of the nodes having impact relationships with the given node with a respective one of the at least two states, wherein each state of the at least two states comprises one of a respective discrete operational status, a respective range of percentage availability or a respective range of throughput levels; changing a state of a first of the nodes; propagating impact of the change to counts associated with one or more second nodes having impact relationships with the first node to reflect the change of the state of the first node; and determining a state of the one or more second nodes with the counts. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A service model impact propagation method, comprising:
-
creating a directed acyclic graph having nodes and directed edges, the nodes representing components of a service impact model, the directed edges representing impact relationships between at least some the components, each of the nodes having one of at least two states, wherein the at least two states are respectively indicative of at least two operational statuses for their respective node; associating one or more counts with at least some of the nodes, each count of the one or more counts for a given one of the nodes representing a number of the nodes having impact relationships with the given node with a respective one of the at least two states, wherein each state of the at least two states comprises one of a respective discrete operational status, a respective range of percentage availability or a respective range of throughput levels; receiving information about a state change in one or more first nodes; propagating impact of the state change to one or more second nodes along the directed edges with the one or more first nodes by; updating counts associated with the one or more second nodes to reflect the state change in the one or more first nodes, and determining a state for the one or more second nodes from the updated counts. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25)
-
Specification