Spectral Graph Theory Based Topology Analysis for Reconfigurable Data Center Networks

Abstract

Emerging technological innovations introduce the possibility to reconfigure the data center topology at runtime. The development of reconfigurable architectures can adapt their topology to account for changing demands, e.g., using Flyways-like augmented links. However, there is no common notion established in this area of how to evaluate the topology, the underlying theoretical analysis is not yet well studied. In this paper, we present the upper bound of the network diameter using spectral graph theory, to the best of our knowledge, which is a first theoretical attempt on understanding the nature of the reconfigurable data center networks. We further prove the algebraic connectivity is insensitive to the weight changes. Finally, based the algebra-connectivity λ 2 , we give a comprehensive link-augmentation validity, which can be implemented in current DCNs potentially.