IP Library › Granted Patent US 12,158,883
Granted Patent B2
US 12,158,883 · App. 17/131,080 · Granted Dec 3, 2024

Visually mapping nodes and connections in one or more enterprise-level systems

Inventors: Hui Zeng (Fairfax, VA); Douglas R. Shumway (Gaithersburg, MD); Paul A. Geske (Raleigh, NC); Wilairat Udomsawat (Fairfax, VA)
Assignee: UNITED STATES POSTAL SERVICE
G06F16/2428G06F16/252G06F16/258G06F16/9024
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,158,883
App. No.
17/131,080
Granted
Dec 3, 2024
Kind
B2
Abstract

A computer-implemented method includes receiving data records from a plurality of different data sources, in which the data records include information regarding elements or components in one or more systems; consolidating the data records; extracting information from the consolidated data records to identify a plurality of nodes and connections between the plurality of nodes in the one or more systems; storing information identifying the plurality of nodes and the connections; and visually presenting the plurality of nodes and the connections in a user interface.

Claims (96)

1. A method for implementing a user interface on electronic devices that visually maps nodes and connections between the nodes in a graphical user interface, the nodes and the connections determined based on an analysis of data records from multiple data sources, the method executing instructions to perform operations comprising:

receiving data records from one or more data sources;

presenting and highlighting, in a map area of a display associated with the user interface, nodes and connections associated with the one or more data sources;

receiving, in a filtering section of the display, criteria for filtering the nodes, the connections, or both the nodes and the connections;

displaying, in the map area, the nodes and the connections satisfying the criteria;

receiving, in a group by options section of the display, options that specify criteria to group the nodes;

displaying the nodes grouped by the criteria specified in the options;

receiving a selection of a node from the nodes that are displayed in the map area;

displaying, in a data links section, information identifying data source connections associated with the selected node;

presenting information about the selected node, including any one of links to the information about the selected node, a document repository associated with the selected node, or a number of applications or data fields associated with the selected node;

displaying and emphasizing inbound edges or outbound edges of the connections to and from the selected node, the inbound edges and the outbound edges representing dataflows;

de-emphasizing inbound edges and outbound edges of the nodes that are not the selected node;

adjusting, in a display options section, a number of hops associated with the selected node, and specifying a spread between nodes, wherein the spread represents a visual distance between nodes;

displaying, in the map area, nodes and connections that are within the number of hops from the selected node according to the specified spread;

determining a level of impact of a proposed change to the selected node to connected nodes based on the number of hops from the selected node to each of the connected nodes; and

declining to synchronize the proposed change to the selected node based at least on the level of impact.

2. The method of claim 1 , the operations further comprising:

identifying the connections based on relationships or dataflows between the nodes.

3. The method of claim 1 , wherein each of the nodes represents at least one of:

a document;

an organization;

an application;

a server;

a virtual machine;

a database; or

a sub-system.

4. The method of claim 1 , the operations further comprising: receiving data formatting or data structuring information, and extracting information from the data records based on the data formatting or the data structuring information.

5. The method of claim 1 , wherein the data records include at least one of:

a dependency matrix;

a system level block diagram;

a system architecture diagram;

an organizational chart;

a network diagram;

network topology information;

a data structure, document configuration management data;

hardware or software transition plans;

policy documents; or

compliance documents.

6. The method of claim 1 , the operations further comprising: adjusting a plan that affects the nodes based on the level of impact.

7. The method of claim 1 , the operations further comprising: grouping the nodes based on common attributes.

8. The method of claim 1 , the operations further comprising: visually presenting the nodes and the connections in a form of at least one of:

a force directed graph,

a network map, or

a table.

9. The method of claim 1 wherein the operations further comprise:

receiving, in the group by options section, a selection of sizing nodes by total edge count; and

presenting each of the nodes with a corresponding count of the connections associated with the node, wherein the size of a graphic representing the node is based on the count.

10. A computer program product for implementing a user interface on electronic devices that visually maps nodes and connections between the nodes in a graphical user interface, the nodes and the connections determined based on an analysis of data records from multiple data sources, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computing device to cause the computing device to perform operations comprising:

receiving data records from one or more data sources;

presenting and highlighting, in a map area of a display associated with the user interface, nodes and connections associated with the one or more data sources;

receiving, in a filtering section of the display, criteria for filtering the nodes, the connections, or both the nodes and the connections;

displaying, in the map area, the nodes and the connections satisfying the criteria;

receiving, in a group by options section of the display, options that specify criteria to group the nodes;

displaying the nodes grouped by the criteria specified in the options;

receiving a selection of a node from the nodes that are displayed in the map area;

displaying, in a data links section, information identifying data source connections associated with the selected node;

presenting information about the selected node, including any one of links to the information about the selected node, a document repository associated with the selected node, or a number of applications or data fields associated with the selected node;

displaying and emphasizing inbound edges or outbound edges of the connections to and from the selected node, the inbound edges and the outbound edges representing dataflows;

de-emphasizing inbound edges and outbound edges of the nodes that are not the selected node;

adjusting, in a display options section, a number of hops associated with the selected node, and specifying a spread between nodes, wherein the spread represents a visual distance between nodes;

displaying, in the map area, nodes and connections that are within the number of hops from the selected node according to the specified spread;

determining a level of impact of a proposed change to the selected node to connected nodes based on the number of hops from the selected node to each of the connected nodes; and

declining to synchronize the proposed change to the selected node based at least on the level of impact.

11. The computer program product of claim 10 , the operations further comprising:

identifying the connections based on relationships or communication dataflows between the nodes.

12. The computer program product of claim 10 , wherein each of the nodes represents at least one of:

a document;

an organization;

an application;

a server;

a virtual machine;

a database; or

a sub-system.

13. The computer program product of claim 10 , the operations further comprising: visually presenting the nodes and the connections in a form of at least one of:

a force directed graph,

a network map, or

a table.

14. A system that implements a user interface on electronic devices that visually maps nodes and connections between the nodes in a graphical user interface, the connections determined based on an analysis of data records from multiple data sources, the system comprising:

one or more memory devices that stores instructions; and

one or more processors that are operably connected to the one or more memory devices and that execute the instructions to perform operations comprising:

receiving data records from one or more data sources;

presenting and highlighting, in a map area of a display associated with the user interface, nodes and connections associated with the one or more data sources;

receiving, in a filtering section of the display, criteria for filtering the nodes, the connections, or both the nodes and the connections;

displaying, in the map area, the nodes and the connections satisfying the criteria;

receiving, in a group by options section of the display, options that specify criteria to group the nodes;

displaying the nodes grouped by the criteria specified in the options;

receiving a selection of a node from the nodes that are displayed in the map area;

displaying, in a data links section, information identifying data source connections associated with the selected node;

presenting information about the selected node, including any one of links to the information about the selected node, a document repository associated with the selected node, or a number of applications or data fields associated with the selected node;

displaying and emphasizing inbound edges or outbound edges of the connections to and from the selected node, the inbound edges and the outbound edges representing dataflows;

de-emphasizing inbound edges and outbound edges of the nodes that are not the selected node;

adjusting, in a display options section, a number of hops associated with the selected node, and specifying a spread between nodes, wherein the spread represents a visual distance between nodes;

displaying, in the map area, nodes and connections that are within the number of hops from the selected node according to the specified spread;

determining a level of impact of a proposed change to the selected node to connected nodes based on the number of hops from the selected node to each of the connected nodes; and

declining to synchronize the proposed change to the selected node based at least on the level of impact.

15. The system of claim 14 , the operations further comprising: visually presenting the nodes and the connections in a of a force directed graph.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 22, 2020
From: ZENG, HUI; SHUMWAY, DOUGLAS R.; GESKE, PAUL A.; UDOMSAWAT, WILAIRAT
To: UNITED STATES POSTAL SERVICE
Reel/Frame 054733/0302 →
Continuity (2)
Provisional Application 62952584 · Dec 23, 2019
Related Publication 20210191930A1 · Jun 24, 2021