Lazy graph construction with compression and a hybrid graph-relational model for representing a network topology
US11855851B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 9, 2022 |
| Grant date | Dec 26, 2023 |
| Priority date | — |
| Expiry date | Mar 9, 2042 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L41/145
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A lazy graph construction with compression includes receiving a query related to a network; one of generating a site graph for the network and accessing the site graph already in memory; performing a search on the site graph based on the query; accessing data in a database and generating, in the memory, a plurality of sub-graphs using the data, for the query; and providing a solution to the query based on the search and a search of the plurality of sub-graphs. The site graph can be at a site level and includes network elements and associated connections in the network, and the plurality of sub-graphs can be at an intra-site level including any of component-to-component connections and intra-component connections.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.