Flexspander: augmenting expander networks in high-performance systems with optical bandwidth steering
Authors:
- 28 February 2020
- journal article
- research article
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 12 (4) , B44-B54
Abstract
Communication efficiency is one of the deciding factors in determining many of today’s high-performance computing (HPC) applications. Traditionally, HPC systems have been on static network topologies, making them inflexible to the variety of skewed traffic demands that may arise due to the spatial locality inherent in many applications. To handle traffic locality, researchers have proposed integrating optical circuit switches (OCSs) into the network architecture, which reconfigures the network topology to alter and dynamically adapt to the predicted traffic. In this paper, we present a novel reconfigurable network topology called Flexspander. Beyond offering a flexible interconnect, Flexspander also offers full flexibility in terms of construction and can be built with any arbitrary combination of commercial electrical packet switches and OCSs. We evaluate Flexspander performance through extensive simulations with multiple network traces, and our results show improved performance for Flexspander over currently proposed static and reconfigurable topologies in terms of the flow completion time.Keywords
Funding Information
- Advanced Research Projects Agency - Energy (DE-AR00000843)
- HP Development Company
- U.S. Department of Energy (B621301)
- National Security Agency (FA8075-14-D-0002-0007, TAT 15-1158)
This publication has 27 references indexed in Scilit:
- Inside the Social Network's (Datacenter) Network2015
- pFabric2013
- B42013
- Valiant Load-Balancing: Building Networks That Can Support All Traffic Matrices2010
- HyperX2009
- A scalable, commodity data center network architectureACM SIGCOMM Computer Communication Review, 2008
- Reconfigurable hybrid interconnection for static and dynamic scientific applications2007
- Three-dimensional Statistical Data Security ProblemsSIAM Journal on Computing, 1994
- Ramanujan graphsCombinatorica, 1988
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971