Journal 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
TLDR
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 can be deployed today, and a working prototype is built.Abstract:
To be agile and cost effective, data centers must allow dynamic resource allocation across large server pools. In particular, the data center network should provide a simple flat abstraction: it should be able to take any set of servers anywhere in the data center and give them the illusion that they are plugged into a physically separate, noninterfering Ethernet switch with as many ports as the service needs. To meet this goal, we present VL2, 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. VL2 uses (1) flat addressing to allow service instances to be placed anywhere in the network, (2) Valiant Load Balancing to spread traffic uniformly across network paths, and (3) end system--based address resolution to scale to large server pools without introducing complexity to the network control plane. VL2's design is driven by detailed measurements of traffic and fault data from a large operational cloud service provider. VL2's implementation leverages proven network technologies, already available at low cost in high-speed hardware implementations, to build a scalable and reliable network architecture. As a result, VL2 networks can be deployed today, and we have built a working prototype. We evaluate the merits of the VL2 design using measurement, analysis, and experiments. Our VL2 prototype shuffles 2.7 TB of data among 75 servers in 395 s---sustaining a rate that is 94% of the maximum possible.read more
Citations
More filters
Proceedings ArticleDOI
APS: Adaptive Packet Sizing for Efficient End-to-End Network Transmission
TL;DR: Adaptively Packet Sizing (APS) is presented, a dynamic packet size adjustment method that can be easily integrated into existing window-based congestion control algorithms and can minimize flow completion time (FCT) according to the instantaneous network condition.
Efficient cross-layer routing and congestion control architectures for distributed systems
TL;DR: This proposal proposes a comprehensive cross-layer congestion control and routing approach along with other schemes to deal with all these challenges of congestion control, routing, large scale distributed systems and Distributed of Denial of Service (DDoS) attacks.
Proceedings ArticleDOI
START:Sensible traffic scheduling in dynamic data center networks
TL;DR: The results show that START significantly outperforms existing flow scheduling schemes DCTCP and L2DCT up to 40% and 45% for small flows in changing network status and in some scenarios, START can even achieve better performance than pFabric.
Proceedings ArticleDOI
Photonic Switching Technologies, Architectures, and Integrated-Systems for Future Disaggregated and Optically Reconfigurable Data Centers
TL;DR: The Tutorial broadly surveys state-of- the-art photonic switching technologies, architectures, and experimental results, and further covers the details of arrayed- waveguide-grating-router-based switch fabrics offering hybrid switching methods with distributed control planes towards scalable data center networking.
Proceedings ArticleDOI
Energy-efficient Deployment of Fat-Tree Hybrid Data Center Networks
TL;DR: The numerical results show that the proposed scheme can potentially exploit the wireless links between different pods to enhance the network energy efficiency by reducing the average path length and the use of switches in the hybrid DCNs.
References
More filters
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Journal ArticleDOI
A scalable, commodity data center network architecture
TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Book
Principles and Practices of Interconnection Networks
William J. Dally,Brian Towles +1 more
TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.
Journal ArticleDOI
The part-time parliament
TL;DR: The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.
Proceedings Article
The Art of Computer Systems Performance Analysis.
TL;DR: The authors' goal is always to offer you an assortment of cost-free ebooks too as aid resolve your troubles.