scispace - formally typeset
Journal ArticleDOI

VL2: a scalable and flexible data center network

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
Journal ArticleDOI

A cross-layer flow schedule with dynamical grouping for mitigating larger-scale TCP incast

TL;DR: A cross-layer flow schedule with dynamical grouping (CLFS-DG) scheme to reduce the effect of TCP incast in DCNs and ensure the quality of service in both local networks and fat-tree topologies typically applied in the DCN.
Journal ArticleDOI

Flow Scheduling Strategies for Minimizing Flow Completion Times in Information-agnostic Data Center Networks

TL;DR: This paper presents MCPF, a flexible and dynamic flow scheduling strategy to reduce the FCT, based on the estimated probabilities of each flow to finish the transmission in a period time, and these flows which have higher completion probabilities are assigned with higher priority.
Journal ArticleDOI

Fault-Tolerant and Unicast Performances of the Data Center Network HSDC

TL;DR: The definition of the logical graph of HSDC, named H_n, is given, which can be treated as a compound graph of hypercube and complete graph of the same dimension, and it is proved that the connectivity and tightly super connectivity of $$H_n$$ are both n.
Journal ArticleDOI

Machine Learning assisted aggregation schemes for optical cross-connect in hybrid electrical/optical data center networks

TL;DR: This paper provides two machine learning assisted aggregation schemes to design optical cross-connect switches to increase the throughput of the circuit-switched network and deploy a machine learning algorithm at edge nodes instead of a central network management system to simultaneously reduce network overhead and latency.
Journal ArticleDOI

Hidden Markov Model-based Load Balancing in Data Center Networks

TL;DR: HMMLB utilizes the hidden Markov Model (HMM) to select paths for data flows with fewer monitored links, less time cost, and approximate the same network throughput rate as a traditional centralized load balancing algorithm.
References
More filters
Journal ArticleDOI

MapReduce: simplified data processing on large clusters

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

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.

Raj Jain
TL;DR: The authors' goal is always to offer you an assortment of cost-free ebooks too as aid resolve your troubles.
Related Papers (5)