US 11,909,598 B2
Component detection and management using relationships
Richard Chart, Truro (GB); Matthew Luebke, Front Royal, VA (US); Karl Ginter, Beltsville, MD (US); Michael Bartman, Potomac, MD (US); and Edward Adams Robie, Jr., Newport, NC (US)
Assigned to ScienceLogic, Inc., Reston, VA (US)
Filed by ScienceLogic, Inc., Reston, VA (US)
Filed on Jan. 17, 2023, as Appl. No. 18/097,792.
Application 16/735,230 is a division of application No. 15/833,236, filed on Dec. 6, 2017, granted, now 10,574,532, issued on Feb. 25, 2020.
Application 15/833,236 is a division of application No. 14/672,743, filed on Mar. 30, 2015, granted, now 9,912,546, issued on Mar. 6, 2018.
Application 18/097,792 is a continuation of application No. 17/330,187, filed on May 25, 2021, granted, now 11,588,700.
Application 17/330,187 is a continuation of application No. 16/735,230, filed on Jan. 6, 2020, granted, now 11,095,524, issued on Aug. 17, 2021.
Claims priority of provisional application 61/971,875, filed on Mar. 28, 2014.
Prior Publication US 2023/0155895 A1, May 18, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 15/16 (2006.01); H04L 41/12 (2022.01); H04L 41/04 (2022.01); H04L 43/08 (2022.01)
CPC H04L 41/12 (2013.01) [H04L 41/04 (2013.01); H04L 43/08 (2013.01)] 21 Claims
OG exemplary drawing
 
1. A system for monitoring and/or managing components including:
a processor, and
memory connected to the processor, the memory storing instructions that when executed by the processor cause the processor to perform operations comprising:
a. detecting a first set of components using a first data collection method,
b. constructing a first set of relationships between the first set of components, wherein the first set of relationships is represented as a first graph,
c. detecting a second set of components using a second data collection method,
d. constructing a second set of relationships between the second set of components, wherein the second set of relationships is represented as a second graph,
wherein the constructed relationships are represented as independent subgraphs in each of the first and second independent graphs,
e. in response to the first and second relationship sets, identifying at least one component in the first component set and at least one component in the second component set as being the same component, and
f. matching a subgraph from the first set of relationships graph to a subgraph in the second set of relationships graph in order to identify common subgraphs between the two independent graphs in order to determine a prospective shared component between the graphs.