US 11,711,270 B1
Creating an optimal node interconnect topology given certain constraints
Vladimir Pelekhaty, Baltimore, MD (US); and Michael Y. Frankel, Pikesville, MD (US)
Assigned to Ciena Corporation, Hanover, MD (US)
Filed by Ciena Corporation, Hanover, MD (US)
Filed on Apr. 19, 2022, as Appl. No. 17/723,829.
Int. Cl. G06F 15/16 (2006.01); H04L 41/12 (2022.01); H04L 43/045 (2022.01)
CPC H04L 41/12 (2013.01) [H04L 43/045 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A non-transitory computer-readable medium configured to store computer logic having instructions that, when executed, cause one or more processing devices to perform steps of:
receiving a first constraint defining a number of nodes (n) to be set in a graph that is to be created, wherein the graph is configured to include a plurality of nodes and a plurality of interconnections, wherein each interconnection is configured to connect a pair of nodes to one another, and wherein the graph is configured to enable each node to reach any other node via one or more interconnections,
receiving a second constraint defining a number of degrees (d) to be set with respect to each node, wherein the number of degrees d defines the maximum number of interconnections that can be connected to each node,
dividing the nodes into a number of clusters (C) and a number of sub-clusters (S) in each cluster such that the number of nodes (n) is divisible by C×S,
upon determining that the graph is developed to an extent where each node is connected to at least one interconnection and every node is reachable by any other node, performing one or more functions with respect to any of the clusters in the graph to improve one or more metrics related to hop count, wherein hop count represents a number of interconnections for one node to reach another node, and
causing configuration of a network topology for a communications network based on the graph where each node is a network element and each interconnection is a communication link interconnecting corresponding nodes.