Methods and systems of application security mesh user interfaces
AssigneeVMware, Inc.
InventorsAmit Jain, Gopi Krishna, Pratik Roychowdhury
Life of this patent
Estimating the term…
Abstract
A computerized method for implementing distributed application security mesh systems comprising: providing a service graph; and providing an underlying mesh graph with a pre-defined paths.
Claims21
A method for modeling interactions between different nodes of an application security mesh comprising:
- providing a service graph, wherein the service graph comprises a set of service graph nodes, wherein each service graph node in the set of service graph nodes represents a service or a workload;
- providing an underlying mesh graph comprising a set of pre-defined mesh graph paths comprises roads that touch one or more of service graph nodes in the set of service graph nodes and highways that do not touch any of the service graph nodes in the set of service graph nodes;
- placing the set of service graph nodes on the mesh graph, wherein each service graph node is positioned on the mesh graph at a respective location where two of the pre-defined mesh graph paths intersect;
- and
- providing a set of connectors between the set of service graph nodes of the service graph corresponding to particular interactions between respective service graph nodes, wherein each connector defines a line following a route between the respective service graph nodes on the pre-defined mesh graph paths;
- and
- wherein traveling along a particular connector between a source service graph node and a destination service graph node comprises:
- jumping from the source graph node to a first road connected to the source graph node;
- jumping from the first road to a closest mesh highway;
- and
- determining a second road that connects to the destination graph node either directly from the closest mesh highway or indirectly through jumps to one or more additional mesh highways.
A system for modeling interactions between different nodes of an application security mesh comprising one or more devices comprising hardware and software embodied in a machine-readable medium and configured to perform operations comprising:
- providing a service graph, wherein the service graph comprises a set of service graph nodes, wherein each service graph node in the set of service graph nodes represents a service or a workload;
- providing an underlying mesh graph comprising a set of pre-defined mesh graph paths comprises roads that touch one or more of service graph nodes in the set of service graph nodes and highways that do not touch any of the service graph nodes in the set of service graph nodes;
- placing the set of service graph nodes on the mesh graph, wherein each service graph node is positioned on the mesh graph at a respective location where two of the pre-defined mesh graph paths intersect;
- and
- providing a set of connectors between the set of service graph nodes of the service graph corresponding to particular interactions between respective service graph nodes, wherein each connector defines a line following a route between the respective service graph nodes on the pre-defined mesh graph paths;
- and
- wherein traveling along a particular connector between a source service graph node and a destination service graph node comprises:
- jumping from the source graph node to a first road connected to the source graph node;
- jumping from the first road to a closest mesh highway;
- and
- determining a second road that connects to the destination graph node either directly from the closest mesh highway or indirectly through jumps to one or more additional mesh highways.
One or non-transitory more machine-readable media embodying software configured to perform operations for modeling interactions between different nodes of an application security mesh comprising:
- providing a service graph, wherein the service graph comprises a set of service graph nodes, wherein each service graph node in the set of service graph nodes represents a service or a workload;
- providing an underlying mesh graph comprising a set of pre-defined mesh graph paths comprises roads that touch one or more of service graph nodes in the set of service graph nodes and highways that do not touch any of the service graph nodes in the set of service graph nodes;
- placing the set of service graph nodes on the mesh graph, wherein each service graph node is positioned on the mesh graph at a respective location where two of the pre-defined mesh graph paths intersect;
- and
- providing a set of connectors between the set of service graph nodes of the service graph corresponding to particular interactions between respective service graph nodes, wherein each connector defines a line following a route between the respective service graph nodes on the pre-defined mesh graph paths;
- and
- wherein traveling along a particular connector between a source service graph node and a destination service graph node comprises:
- jumping from the source graph node to a first road connected to the source graph node;
- jumping from the first road to a closest mesh highway;
- and
- determining a second road that connects to the destination graph node either directly from the closest mesh highway or indirectly through jumps to one or more additional mesh highways.
Dependencies are inferred from the claim text.