On the complexity of non-segregated routing in reconfigurable data center architectures

Abstract

By enhancing the traditional static network (e.g., based on electric switches) with a dynamic topology (e.g., based on recongurable optical switches), emerging recongurable data centers introduce unprecedented exibilities in how networks can be optimized toward the workload they serve. However, such hybrid data centers are currently limited by a restrictive routing policy enforcing arti-cial segregation: each network ow can only use either the static or the exible topology, but not a combination of the two. This paper explores the algorithmic problem of supporting more general routing policies, which are not limited by segregation. While the potential benets of non-segregated routing have been demonstrated in recent work, the underlying algorithmic complexity is not well-understood. We present a range of novel results on the algorithmic complexity of non-segregated routing. In particular, we show that in certain specic scenarios, optimal data center topologies with non-segregated routing policies can be computed in polynomial-time. In many variants of the problem, however, introducing a more exible routing comes at a price of complexity: we prove several important variants to be NP-hard.