Impact propagation in a directed acyclic graph
US8301755B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 14, 2007 |
| Grant date | Oct 30, 2012 |
| Priority date | — |
| Expiry date | Aug 15, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/10
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.