Generic and automatic address configuration for data center networks
AssigneeMicrosoft Corporation
InventorsKai Chen, Chuanxiong Guo, Haitao Wu
Life of this patent
Estimating the term…
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.
Claims20
One or more computer-readable storage devices storing computer-executable instructions, that when executed by a processor, configure the processor to perform acts comprising:
- receiving a first graph of nodes, the nodes of the first graph being arranged in a first topology;
- receiving a second graph of nodes, the nodes of the second graph being arranged in a second topology, the first topology and the second topology both being representations of an entity;
- selecting a first node from the first graph and a first node from the second graph, the first node from the first graph and the first node from the second graph being a first anchor pair;
- determining that the first node from the first graph and the first node from the second graph are symmetrical to each other;
- generating a one-hop subgraph of the first graph and a one-hop subgraph of the second graph, the one-hop subgraph of the first graph comprising at least nodes that are a single connection link from the first node of the first graph, and the one-hop subgraph of the second graph comprising at least nodes that are a single connection link from the first node of the second graph;
- determining if the one-hop subgraph from the first graph and the one-hop subgraph from the second graph are isomorphic;
- and
- if the one-hop subgraph of the first graph and the one-hop subgraph of the second graph are not isomorphic, incrementing counters that are associated with the nodes of the one-hop subgraph of the first graph and incrementing counters associated with the nodes of the one-hop subgraph of the second graph.
A method comprising:
- receiving a first graph of nodes, the nodes of the first graph being arranged in a first topology;
- receiving a second graph of nodes, the nodes of the second graph being arranged in a second topology;
- selecting, by a processor, a first node from the first graph and a first node from the second graph, the first node from the first graph and the first node from the second graph being symmetrical to each other;
- generating, by the processor, a one-hop subgraph of the first graph and a one-hop subgraph of the second graph, the one-hop subgraph of the first graph comprising at least the first node of the first graph and nodes that are a single connection link from the first node of the first graph, and the one-hop subgraph of the second graph comprising at least the first node of the second graph and nodes that are a single connection link from the first node of the second graph;
- determining, by the processor, if the one-hop subgraph from the first graph and the one-hop subgraph from the second graph are isomorphic;
- and
- if the one-hop subgraph of the first graph and the one-hop subgraph of the second graph are not isomorphic, incrementing counters that are associated with the nodes of the one-hop subgraph of the first graph and incrementing counters associated with the nodes of the one-hop subgraph of the second graph.
A method comprising:
- selecting, by a processor, a first node from a first graph and a first node from a second graph that is symmetrical to the first node from the first graph, the first and second graphs having nodes arranged in respective topologies;
- generating, by the processor, a one-hop subgraph of the first graph and a one-hop subgraph of the second graph, the one-hop subgraph of the first graph comprising at least nodes that are a single connection link from the first node of the first graph, and the one-hop subgraph of the second graph comprising at least nodes that are a single connection link from the first node of the second graph;
- determining, by the processor, if the one-hop subgraph from the first graph and the one-hop subgraph from the second graph are isomorphic;
- and
- if the one-hop subgraph of the first graph and the one-hop subgraph of the second graph are not isomorphic, incrementing counters that are associated with the nodes of the one-hop subgraph of the first graph and incrementing counters associated with the nodes of the one-hop subgraph of the second graph.
Dependencies are inferred from the claim text.