Towards 48-fold cabling complexity reduction in large flattened butterfly networks

Csernai, Márton; Ciucu, Florin; Braun, Ralf-Peter; Gulyás, András

doi:10.1109/infocom.2015.7218373

Cited by 2 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conventional electrical DCNs (e.g., FatTree [1], Bcube [8], VL2 [7] and Flattened Butterfly [5]) are built using a multi-layer approach, with a large number of switches at the bottom level to connect with servers/racks and a few highend switches located at the upper layers to aggregate and distribute the traffic. Those networks rely heavily on high-cost and power-hungry electrical switches, and operators are facing limited scalability, high latency and low energy efficiency problems.…”

Section: Introductionmentioning

confidence: 99%

RHODA Topology Configuration Using Bayesian Optimization

Tian

Modiano

et al. 2020

Optical Network Design and Modeling

View full text Add to dashboard Cite

The rapid growth of data center traffic requires data center networks (DCNs) to be scalable, energy-efficient, and provide low latencies. Optical Wavelength Division Multiplexing (WDM) is a promising technique to build data centers comprising millions of servers. In [24], a WDM-based Reconfigurable Hierarchical Optical DCN Architecture (RHODA) was presented, which can accommodate up to 10+ million of servers and a variety of traffic patterns. RHODA also saves tremendous amounts of power and cost through its extensive use of passive optical devices, and minimal use of power-hungry and costly devices. RHODA achieves high throughput through reconfigurable clustering of racks of servers. In this paper, we focus on the design of the cluster topology (also called inter-cluster network). Given the pair-wise cluster traffic, our objective for the cluster topology is to minimize the average hop length. In [24], a simple variant of the Hungarian algorithm that maximizes the one-hop or direct traffic among clusters was used. In this paper, we leverage the Bayesian Optimization (BO) framework and propose a fast algorithm to minimize the average number of hops in the inter-cluster network of RHODA. To the best of our knowledge, this is the first paper that employs BO to optimize optical DCN performance. We present our design decisions and modifications to BO based on the network constraints. Results show that BO can achieve optimal or near-optimal results, and outperforms a well-known regular topology (Gemnet) and the Hungarian-based method by up to 13% and 58%, respectively.

show abstract