Costly Circuits, Submodular Schedules: Hybrid Switch Scheduling for Data Centers

TL;DR

This paper presents a nearly-optimal, lightweight scheduling algorithm for hybrid circuit and packet switches in data centers, effectively balancing reconfiguration costs with traffic demands and outperforming existing methods.

Contribution

It introduces a simple, submodular-optimization-based scheduling algorithm that achieves at least half the optimal performance and generalizes to multi-hop routing for improved connectivity.

Findings

Algorithm achieves performance at least 50% of optimal

Outperforms state-of-the-art in various traffic scenarios

Demonstrates exponential connectivity with indirect routing

Abstract

Hybrid switching - in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch - is a promising alternative to interconnect servers in today's large scale data-centers. Circuit switches offer a very high link rate, but incur a non-trivial reconfiguration delay which makes their scheduling challenging. In this paper, we demonstrate a lightweight, simple and nearly-optimal scheduling algorithm that trades-off configuration costs with the benefits of reconfiguration that match the traffic demands. The algorithm has strong connections to submodular optimization, has performance at least half that of the optimal schedule and strictly outperforms state of the art in a variety of traffic demand settings. These ideas naturally generalize: we see that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi hop routing, distinct from the well-known load balancing effects.