US 11,855,851 B2
Lazy graph construction with compression and a hybrid graph-relational model for representing a network topology
Andrew D. Shiner, Ottawa (CA); Frederic Poulin, Gatineau (CA); and Alex W. MacKay, Ottawa (CA)
Assigned to Ciena Corporation, Hanover, MD (US)
Filed by Ciena Corporation, Hanover, MD (US)
Filed on Mar. 9, 2022, as Appl. No. 17/690,464.
Prior Publication US 2023/0291653 A1, Sep. 14, 2023
Int. Cl. H04L 41/12 (2022.01); H04L 41/08 (2022.01); H04L 41/0816 (2022.01); H04L 41/02 (2022.01)
CPC H04L 41/12 (2013.01) [H04L 41/024 (2013.01); H04L 41/0816 (2013.01); H04L 41/0886 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium comprising instructions that, when executed, cause one or more processors to perform steps of:
receiving a query related to a network, wherein the query is a request for a path in the 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 such that the plurality of sub-graphs are generated based on and only if necessary to answer specific questions associated with the query; and
providing a solution to the query based on the search and a search of the plurality of sub-graphs, wherein the solution included a wavelength, connectivity of the wavelength for add/drop, a path between nodes in the network, and connectivity at intermediate nodes in the network,
wherein the site graph is at a site level and includes network elements and associated connections in the network, and the plurality of sub-graphs are at an intra-site level including any of component-to-component connections and intra-component connections.