IP Library Granted Patent US 12,316,506
Granted Patent B2
US 12,316,506 · App. 18/531,188 · Granted May 27, 2025

Network management using hierarchical and multi-scenario graphs

Inventors: Ulrich A. Finkler (Mahopac, NY); Fook-Luen Heng (Yorktown Heights, NY); Steven N. Hirsch (Burlington, VT); Mark A. Lavin (Katonah, NY); Jun Mei Qu (Beijing, CN); Amith Singhee (Bangalore, IN); Wei Wu (Xi'an, CN)
Assignee: Utopus Insights, Inc.
H04L41/12H04L41/145H04L41/22
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,316,506
App. No.
18/531,188
Granted
May 27, 2025
Kind
B2
Abstract

A method, system, and computer program product to manage a network comprising a plurality of interconnected components are described. The method includes obtaining a set of all the components that are part of the network over time, and identifying one or more repeating patterns of components among the set of all the components as corresponding lower-level definitions to generate a hierarchical set of all the components. The method also includes obtaining time-varying information regarding topology and operational values within the network, and creating a representation of the network at a set of times based on the hierarchical set of all the components and the time-varying information.

Claims (35)

1. A method of managing a network comprising a plurality of interconnected components, the method comprising:

obtaining a set of all the components that are part of the network over time;

identifying one or more repeating patterns of connectivity between two or more components among the set of all the components as corresponding lower-level definitions to generate a hierarchical set of all the components;

obtaining time-varying information regarding changes in topology within the network, wherein a change in topology indicates a change in an arrangement of the plurality of interconnected components;

creating a representation of the network at a set of times based on the hierarchical set of all the components and the time-varying information such that each of the one or more repeating patterns of components is represented as a corresponding single representation; and

testing at least one scenario of the network based on the representation.

2. The method of claim 1 , wherein the at least one scenario being used to determine a future configuration of the network.

3. The method of claim 2 , wherein the testing determines a subset of interconnected components downstream of a particular component.

4. The method of claim 1 , further comprising obtaining time varying information regarding changes in operational value indicates a change in conductivity and flow status of a component of the plurality of interconnected components.

5. The method of claim 4 , further comprising, determining snapshots of a plurality of snapshots that indicate the operational values.

6. The method of claim 5 , further comprising, determining the snapshots of the plurality of snapshots that indicate operational values based on developing a collection of values at the set of times indicating flow state and direction of flow at the set of times for the one or more components of the set of components.

7. The method of claim 6 , wherein the snapshots of the plurality of snapshots indicate if one or more of the components are conducting electricity at any time of the set of times.

8. The method of claim 7 , wherein conductivity of electricity for the one or more components of the set of components includes an indication indicating if the one or more components of the set of components is conducting electricity.

9. The method of claim 1 , further comprising, answering a query about the network based on the representation at a time of interest among the set of times.

10. A non-transitory computer-readable medium including executable instructions, the executable instructions being executable by a processor to perform a method, the method comprising:

obtaining a set of all components that are part of a network over time;

identifying one or more repeating patterns of connectivity between two or more components among the set of all the components as corresponding lower-level definitions to generate a hierarchical set of all the components;

obtaining time-varying information regarding changes in topology within the network, wherein a change in topology indicates a change in an arrangement of a plurality of interconnected components;

creating a representation of the network at a set of times based on the hierarchical set of all the components and the time-varying information such that each of the one or more repeating patterns of components is represented as a corresponding single representation; and

testing at least one scenario of the network based on the representation.

11. The non-transitory computer-readable medium of claim 10 , wherein the at least one scenario being used to determine a future configuration of the network.

12. The non-transitory computer-readable medium of claim 11 , wherein the testing determines a subset of interconnected components downstream of a particular component.

13. The non-transitory computer-readable medium of claim 10 , further comprising obtaining time varying information regarding changes in operational value indicates a change in conductivity and flow status of a component of the plurality of interconnected components.

14. The non-transitory computer-readable medium of claim 13 , further comprising determining snapshots of a plurality of snapshots that indicate the operational values.

15. The non-transitory computer-readable medium of claim 14 , further comprising determining the snapshots of the plurality of snapshots that indicate operational values based on developing a collection of values at the set of times indicating flow state and direction of flow at the set of times for the one or more components of the set of components.

16. The non-transitory computer-readable medium of claim 15 , wherein the snapshots of the plurality of snapshots indicate if one or more of the components are conducting electricity at any time of the set of times.

17. The non-transitory computer-readable medium of claim 16 , wherein the conductivity of electricity for the one or more components of the set of components includes an indication indicating if the one or more components of the set of components is conducting electricity.

18. The non-transitory computer-readable medium of claim 17 , further comprising answering a query about the network based on the representation at a time of interest among the set of times.

19. A computer program product comprising:

a non-transitory storage medium readable by a processing circuit and storing instructions for executing by the processing circuit to perform a method of managing a network that includes assets, the method comprising:

obtaining a set of all components that are part of the network over time;

identifying one or more repeating patterns of connectivity between two or more components among the set of all the components as corresponding lower-level definitions to generate a hierarchical set of all the components;

obtaining time-varying information regarding changes in topology within the network, wherein a change in topology indicates a change in an arrangement of a plurality of interconnected components;

creating a representation of the network at a set of times based on the hierarchical set of all the components and the time-varying information such that each of the one or more repeating patterns of components is represented as a corresponding single representation; and

testing at least one scenario of the network based on the representation.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: FINKLER, ULRICH A.; HENG, FOOK-LUEN; HIRSCH, STEVEN N.; LAVIN, MARK A.; QU, JUN MEI; SINGHEE, AMITH; WU, WEI
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 065926/0533 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 20, 2023
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: UTOPUS INSIGHTS, INC.
Reel/Frame 065926/0696 →
Continuity (7)
Continuation 17804847 · May 31, 2022
Continuation 16801145 · Feb 25, 2020
Continuation 15884290 · Jan 30, 2018
Continuation 14950219 · Nov 24, 2015
Continuation 14856652 · Sep 17, 2015
Provisional Application 62138547 · Mar 26, 2015
Related Publication 20240267297A1 · Aug 8, 2024
References Cited (10)
US 9882782B2 · Finkler · 2018 [cited by examiner]
US 9893948B2 · Finkler · 2018 [cited by examiner]
US 10574533B2 · Finkler · 2020 [cited by examiner]
US 11349720B2 · Finkler · 2022 [cited by examiner]
US 11888698B2 · Finkler · 2024 [cited by examiner]
US 20040186903A1 · Lambertz · 2004 [cited by applicant]
US 20070268294A1 · Eagen et al. · 2007 [cited by applicant]
US 20110289207A1 · Liu · 2011 [cited by examiner]
US 20120036484A1 · Zhang · 2012 [cited by examiner]
US 20140201359A1 · Uppalli · 2014 [cited by examiner]