Generic and automatic address configuration for data center networks

Abstract

This application describes a system and method for auto configuring data center networks. The networks include a plurality of electronic devices that may include switches, servers, routers, or any other device that may be used in a data center network. Graph theory is applied to the arrangement of the network devices to determine if the intended design of the data network matches the actual implementation of the network. This may be achieved by resolving the blueprint graph with the physical graph to determine if they are isomorphic. Also, the isomorphic techniques may be used to detect miswirings in the network that do not cause a node degree change for any of the network components.

1 - 6 . (canceled) 
     
     
         7 . One or more computer-readable storage devices comprising memory storing computer executable instructions, that when executed by a processor, configure the processor to perform acts comprising:
 receiving a first graph representative of a first plurality of nodes arranged in a first topology;   receiving a second graph representative of a second plurality of nodes arranged in a second topology, each node of each topology associated with a location indication including a distribution of distances between the node and other nodes of the topology; and   generating a one-to-one mapping of the first plurality of nodes in the first graph to the second plurality of nodes in the second graph based at least in part on similarities of the distribution of distances for individual ones of the first plurality of nodes in the first graph and individual ones of the second plurality of nodes in the second graph.   
     
     
         8 . The one or more computer-readable storage devices of  claim 7 , wherein the generating of the one-to-one mapping is further based at least in part on whether individual ones of the first plurality of nodes in the first topology are in a same orbit as individual ones of the second plurality of nodes in the second topology and whether the individual ones of the first plurality of nodes in the first topology are connected directly to another node in the first topology. 
     
     
         9 . The one or more computer-readable storage devices of  claim 7 , wherein, for each node of each topology, a distance between the node and any other node in the topology is based in part on a number of nodes that separate the node from another node in the topology. 
     
     
         10 . The one or more computer-readable storage devices of  claim 7 , wherein, for each node of each topology, the distribution of distances is based at least in part on a plurality of connections between the node and the other nodes of the topology. 
     
     
         11 . The one or more computer-readable storage devices of  claim 7 , wherein the first topology and the second topology are both representations of a network of electronic devices. 
     
     
         12 - 20 . (canceled) 
     
     
         21 . A method, comprising:
 receiving, at a computing device, a first graph representative of a first plurality of nodes arranged in a first topology;   receiving, at the computing device, a second graph representative of a second plurality of nodes arranged in a second topology; and   generating, by one or more processors of the computing device, a one-to-one mapping of the first plurality of nodes in the first graph to the second plurality of nodes in the second graph.   
     
     
         22 . The method of  claim 21 , further comprising:
 selecting a first node from the first graph and a first node from the second graph for designation as an inducing pair of nodes; and   comparing a number of connections associated with each node of the inducing pair of nodes to determine whether the inducing pair of nodes are corresponding nodes between the first graph and the second graph, the inducing pair of nodes being corresponding nodes if the first node from the first graph has a same number of connections as the first node from the second graph, wherein the generating the one-to-one mapping is based at least in part on the comparing.   
     
     
         23 . The method of  claim 22 , further comprising selecting a first subset of the first plurality of nodes and a second subset of the second plurality of nodes, wherein the first node from the first graph is selected from the first subset and the first node from the second graph is selected from the second subset. 
     
     
         24 . The method of  claim 22 , wherein the number of connections associated with each node of the inducing pair of nodes is determined by isomorphic division using the inducing pair of nodes. 
     
     
         25 . The method of  claim 21 , further comprising:
 iteratively selecting inducing pairs of nodes, each inducing pair of nodes including one node from the first graph and one node from the second graph; and   comparing, for each inducing pair of nodes, a first number of connections associated with the one node from the first graph to a second number of connections associated with the one node from the second graph to determine whether the inducing pair of nodes are corresponding nodes between the first graph and the second graph, the inducing pair of nodes being corresponding nodes if the one node from the first graph has a same number of connections as the one node of the second graph, wherein the generating the one-to-one mapping is based at least in part on the comparing.   
     
     
         26 . The method of  claim 25 , further comprising, upon determining that a selected inducing pair of nodes are corresponding nodes between the first graph and the second graph, mapping the corresponding nodes to each other based on the comparing in order to generate the one-to-one mapping. 
     
     
         27 . The method of  claim 25 , wherein the iteratively selecting comprises selecting the inducing pairs of nodes in an order of priority based at least in part on similarities of distributions of distances between individual ones of the first plurality of nodes and individual ones of the second plurality of nodes, the order of priority allowing for reducing a number of iterations to generate the one-to-one-mapping. 
     
     
         28 . The method of  claim 27 , wherein the selecting the inducing pairs in the order of priority is further based at least in part on a number of nodes at each distance in the distributions of distances. 
     
     
         29 . The method of  claim 25 , further comprising determining that a selected pair of nodes are not corresponding nodes, wherein the iteratively selecting comprises prioritizing nodes that are in a different orbit as one node of the selected pair of nodes for comparison with the one node of the selected pair of nodes. 
     
     
         30 . One or more computer-readable storage devices comprising memory storing computer executable instructions, that when executed by a processor, configure the processor to perform acts comprising:
 receiving a first graph representative of a first plurality of nodes arranged in a first topology;   receiving a second graph representative of a second plurality of nodes arranged in a second topology; and   generating a one-to-one mapping of the first plurality of nodes in the first graph to the second plurality of nodes in the second graph.   
     
     
         31 . The one or more computer-readable storage devices of  claim 29 , the acts further comprising:
 iteratively selecting inducing pairs of nodes, each inducing pair of nodes including one node from the first graph and one node from the second graph; and   comparing, for each inducing pair of nodes, a first number of connections associated with the one node from the first graph to a second number of connections associated with the one node from the second graph to determine whether the inducing pair of nodes are corresponding nodes between the first graph and the second graph, the inducing pair of nodes being corresponding nodes if the one node from the first graph has a same number of connections as the one node of the second graph, wherein the generating the one-to-one mapping is based at least in part on the comparing.   
     
     
         32 . The one or more computer-readable storage devices of  claim 31 , wherein the iteratively selecting comprises selecting the inducing pairs of nodes in an order of priority based at least in part on similarities of distributions of distances between individual ones of the first plurality of nodes and individual ones of the second plurality of nodes, the order of priority allowing for reducing a number of iterations to generate the one-to-one-mapping. 
     
     
         33 . The one or more computer-readable storage devices of  claim 32 , wherein the selecting the inducing pairs in the order of priority is further based at least in part on a number of nodes at each distance in the distributions of distances. 
     
     
         34 . The one or more computer-readable storage devices of  claim 31 , the acts further comprising determining that a selected pair of nodes are not corresponding nodes, wherein the iteratively selecting comprises prioritizing nodes that are in a different orbit as one node of the selected pair of nodes for comparison with the one node of the selected pair of nodes. 
     
     
         35 . The one or more computer-readable storage devices of  claim 31 , wherein the first number of connections and the second number of connections are each determined by isomorphic division.