Directed Acyclic Graph Impact Propagation with Restricted Views
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Impact calculation and propagation in large enterprise computing environments are resource-intensive and often require redundant graph traversal due to complex service models and security restrictions, leading to inefficiencies in processing multiple impacting events and displaying restricted information.
Innovation Solution
A directed acyclic graph with restricted views is used to propagate service impacts efficiently, employing metadata arrays to minimize graph traversal and terminate calculations when no further propagation is needed, ensuring only authorized users receive real-time notifications of impacted states.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional impact propagation techniques are used to process multiple impacting events in real-time, then complete impact coverage is achieved, but redundant graph traversal and calculations are performed leading to high resource consumption and low processing efficiency
Solution Approach 1:
The patent pre-calculates and stores impact sets for all graph nodes before runtime. When an impacting event occurs, the system directly retrieves pre-computed impact sets from memory rather than performing recursive graph traversal, eliminating redundant calculations and significantly improving real-time processing efficiency
Solution Approach 2:
The system computes impact sets for all possible nodes in advance (excessive action), storing them for immediate retrieval. This pre-computation approach ensures that during actual event processing, only memory access is required, not full graph traversal, reducing computational overhead during critical real-time operations
2Reliability
If security restrictions are implemented to limit user access to certain service component information, then authorized access control is achieved, but tracking and handling restricted information becomes complex and difficult
Solution Approach 1:
The patent segments the service impact model into multiple domains with defined boundaries. Each domain contains specific service components that can be independently accessed based on user authorization. This segmentation simplifies access control by allowing administrators to grant or deny access to entire domains rather than individual components, reducing the complexity of tracking restricted information
Solution Approach 2:
The system introduces an intermediary layer (the impact propagation engine with domain awareness) that automatically handles access control checks. When propagating impact information, the engine intermediates between the data model and users, automatically filtering information based on user permissions and domain restrictions, thereby simplifying the management of restricted information
3Measurement precision
If recursive traversal of large impact models is performed to calculate service impacts, then complete impact analysis is achieved, but the process becomes very resource-intensive and computing expensive
Solution Approach 1:
The patent performs impact set calculations in advance and stores them in memory. During actual impact analysis, the system retrieves pre-computed results rather than performing recursive traversal, maintaining complete impact analysis accuracy while dramatically reducing computational energy consumption
Solution Approach 2:
The system creates and stores copies of impact sets for all graph nodes in advance. These copied impact sets are kept in memory for rapid retrieval during event processing, eliminating the need to re-traverse the graph structure and reducing computational energy requirements while preserving complete impact analysis capability
Data Source
AI summary
Service impact data is efficiently propagated in a directed acyclic graph with restricted views. One or more service components, impact rules and business rules are 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. Subsequently, calculations are terminated without having to traverse the entire graph. This method allows a system or business administrator to view and receive real-time notification of the impacted state of all nodes in the graph that are available to their permitted view. Restricted views ensure that available service impact data is only displayed to end users having the proper authorization to view the underlying impact model data.