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

Optimal Rack-Coordinated Updates in Erasure-Coded Data Centers: Design and Analysis

TL;DR: In this paper , Shen et al. proposed a new rack-coordinated update mechanism to suppress the cross-rack update traffic, which comprises two successive phases: a delta-collecting phase that collects data delta chunks, and another selective parity update phase that renews the parity chunks based on the update pattern and parity layout.
Proceedings ArticleDOI

Modeling and Evaluation of a Data Center Sovereignty with Software Failures

TL;DR: In this article , the authors evaluated the impact of choosing the hardware and software manufacturers appropriately on the DCN robustness and provided design guidelines for DCN operators based on the findings of the analyses.
Journal Article

Utility-Driven Bandwidth Allocation in Data Center Networks

TL;DR: This paper investigates the problem of maximizing application utility in data center networks considering both the throughput and the delay influence and formulate the utility-driven bandwidth allocation problem as a convex optimization with the objective of maximizing overall utility across all applications.
Journal ArticleDOI

A sub-action aided deep reinforcement learning framework for latency-sensitive network slicing

TL;DR: In this article , a sub-action aided double deep Q-network (SADDQN)-based network slicing algorithm for latency-aware services is proposed, where the authors model network slicing as a Markov decision process (MDP), where the virtual network function (VNF) placements to be the actions of the MDP, and define a reward function based on cost and service priority.
Proceedings ArticleDOI

RESISTING: Um Novo Mecanismo de Fast-Reroute com Distribuição de Pacotes em Switches Programáveis P4

TL;DR: In this paper , a new mecanism of FRR Equal-Cost Multi-Path (ECMP) was proposed for switches programáveis in P4, oferecção balanceamento dos fluxos de pacotes durante a recuperação de falhas.
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)