Proceedings ArticleDOI
REWIRE: An optimization-based framework for unstructured data center network design
Andrew R. Curtis,Tommy Carpenter,Mustafa Elsheikh,Alejandro López-Ortiz,Srinivasan Keshav +4 more
- pp 1116-1124
Reads0
Chats0
TLDR
A data center network design framework, that is called REWIRE, to design networks using an optimization algorithm, which significantly outperforms previous solutions and has up to 100-500% more bisection bandwidth and less end-to-end network latency than equivalent-cost DCNs built with best practices.Abstract:
Despite the many proposals for data center network (DCN) architectures, designing a DCN remains challenging. DCN design is especially difficult when expanding an existing network, because traditional DCN design places strict constraints on the topology (e.g., a fat-tree). Recent advances in routing protocols allow data center servers to fully utilize arbitrary networks, so there is no need to require restricted, regular topologies in the data center. Therefore, we propose a data center network design framework, that we call REWIRE, to design networks using an optimization algorithm. Our algorithm finds a network with maximal bisection bandwidth and minimal end-to-end latency while meeting user-defined constraints and accurately modeling the predicted cost of the network. We evaluate REWIRE on a wide range of inputs and find that it significantly outperforms previous solutions—its network designs have up to 100–500% more bisection bandwidth and less end-to-end network latency than equivalent-cost DCNs built with best practices.read more
Citations
More filters
Proceedings Article
Jellyfish: networking data centers randomly
TL;DR: Jellyfish as mentioned in this paper is a high-capacity network interconnect which, by adopting a random graph topology, yields itself naturally to incremental expansion, supporting as many as 25% more servers at full capacity using the same equipment at the scale of a few thousand nodes, and this advantage improves with scale.
Journal ArticleDOI
A Survey on Data Center Networking (DCN): Infrastructure and Operations
TL;DR: A systematic taxonomy and survey of recent research efforts on the DCN is presented, which proposes to classify these research efforts into two areas: 1) DCN infrastructure and 2)DCN operations.
Journal ArticleDOI
The features, hardware, and architectures of data center networks
TL;DR: A survey on the features and hardware of Data Center Networks, including performance comparisons among typical topology designs, connectivity discussion on average degree, bandwidth calculation, and diameter estimation, as well as the capacity enhancement of DCN's with wireless antennae and optical devices.
Proceedings ArticleDOI
High throughput data center topology design
TL;DR: This paper presents the first non-trivial upper-bound on network throughput under uniform traffic patterns for any topology with identical switches, and shows that random graphs achieve throughput surprisingly close to this bound, within a few percent at the scale of a few thousand servers.
Proceedings ArticleDOI
Minimizing Communication in All-Pairs Shortest Paths
TL;DR: A tighter lower bound on latency is provided, which dictates that the latency overhead is necessary to reduce bandwidth along the critical path of execution, and achieves impressive performance and scaling to 24,576 cores of a Cray XE6 supercomputer by utilizing well-tuned intra-node kernels within the distributed memory algorithm.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Introduction to algorithms: 4. Turtle graphics
TL;DR: In this article, a language similar to logo is used to draw geometric pictures using this language and programs are developed to draw geometrical pictures using it, which is similar to the one we use in this paper.
Proceedings ArticleDOI
Dryad: distributed data-parallel programs from sequential building blocks
TL;DR: The Dryad execution engine handles all the difficult problems of creating a large distributed, concurrent application: scheduling the use of computers and their CPUs, recovering from communication or computer failures, and transporting data between vertices.
Proceedings ArticleDOI
VL2: a scalable and flexible data center network
Albert Greenberg,James R. Hamilton,Navendu Jain,Srikanth Kandula,Changhoon Kim,Parantap Lahiri,David A. Maltz,Parveen Patel,Sudipta Sengupta +8 more
TL;DR: VL2 is a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics, and is built on a working prototype.