Tree-conf: A fast automatic address configuration method for tree-like data center networks

Automatic address configuration is a key problem in data center networks. For performance and routing considerations, most of the recently proposed data center structures are well-structured. Their node addresses are usually dependent on node locations, making the traditional automatic address configuration schemes such as DHCP infeasible. Recently, some new solutions have been proposed. Both the recent works DAC and ETAC transfer the address configuration problem into a graph isomorphism problem and address them by a graph isomorphism theory. But in a general case, graph isomorphism is hard. Another work DCZeroconf is another automatic address configuration method. But the addresses configured by DCZeroconf are topology-independent, which is not satisfied with our requirements. In this paper, we present Tree-conf, a fast automatic addresses configuration method for tree-like data center networks. By intelligently leveraging the structure characteristics of tree-like data center networks, Tree-conf can perform automatic address configuration effectively. Our simulation results show that Tree-conf can finish the configuration process in less than 2s for a data center network with hundreds of thousands of nodes.