Cloud Security Policy Reliability Prediction via Graph Database Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Cloud computing environments face challenges in predicting the reliability of security policies due to high entropy and rapid changes, which can lead to security policy failures and data breaches.

Innovation Solution

A method utilizing a graph database to represent cloud workloads as nodes and relationships as edges, analyzing these relationships over time to determine a reliability score for security policies, by generating earliest points in time for each rule and performing regression analysis to predict future changes and potential policy failures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If security policies are implemented in dynamic cloud environments, then security protection is improved, but reliability of security policies deteriorates due to high entropy and rapid changes

Engineering Contradiction:
Improvesecurity policy reliabilityVSAvoidadaptability to dynamic changes
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The system performs preliminary actions by generating earliest points in time for security policy rules before actual policy failures occur. This allows the system to proactively identify when relationships first appear in the graph database and predict potential policy reliability issues before they manifest, enabling preventive rather than reactive security management.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system embraces dynamics by continuously updating the graph database to reflect changing cloud workload relationships. The graph database dynamically captures evolving relationships between cloud workloads, allowing security policies to adapt to new patterns while the system tracks temporal changes to assess reliability over time.

Inventive Principle:
Principle #15Dynamics

2Measurement precision

If graph database analysis is performed to predict reliability, then measurement precision is improved, but device complexity increases

Engineering Contradiction:
Improvereliability score accuracyVSAvoidsystem complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system introduces an intermediary mechanism - the graph database - that mediates between complex cloud workload relationships and security policy reliability assessment. The graph database serves as an intermediate layer that structures and temporalizes relationship data, making it analyzable without requiring direct complex processing of raw cloud infrastructure data.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system creates a simplified copy or representation of cloud workload relationships in the graph database. Instead of analyzing the full complexity of actual cloud infrastructure directly, the system works with a copied, structured representation that captures essential relationships and temporal patterns, reducing analytical complexity while maintaining measurement precision.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS11290494B2Reliability prediction for cloud security policies
Publication Date: 2022.03.29 GRYPHO5 LLC
  • US11290494B2 patent drawing
  • US11290494B2 patent drawing
  • US11290494B2 patent drawing

AI summary

Methods and systems for reliability prediction of security policies in a cloud computing environment are provided. An example method includes providing a graph database representing workloads of the cloud computing environment as nodes and relationships between the workloads as edges, the relationships being associated with points in time, receiving a security policy including rules for the relationships between the workloads, generating a plurality of earliest points in time based on the rules and the graph database, wherein generating the plurality of earliest points in time includes: determining, for each rule of the rules, a subset of the relationships in the graph database such that each of the subset of the relationships matches the rule, and selecting an earliest point in time from points in time associated with relationships from the subset, and analyzing the plurality of earliest points in time to determine a reliability score for the security policy.