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
Proceedings Article

Re-architecting Congestion Management in Lossless Ethernet

TL;DR: The Photonic Congestion Notification scheme is proposed, which consists of a novel congestion detection and identification mechanism to recognize which flows are really responsible for congestion, and a receiver-driven rate adjustment method to alleviate congestion in as short as 1 RTT.
Proceedings Article

deTector: a Topology-aware Monitoring System for Data Center Networks

TL;DR: In this article, a network monitoring system that is able to detect and localize network failures accurately in near real-time while minimizing the monitoring overhead is presented, which achieves this goal by tightly coupling detection and localization and carefully selecting probe paths.
Journal ArticleDOI

A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks

TL;DR: An efficient multiple membership query algorithm, called Scalar-pair Vectors Routing and Forwarding (SVRF), based on the prime theory such as Chinese Remainder Theorem, which can achieve remarkable performance in terms of memory consumption, processing time, hardware cost, and 100% delivery accuracy in a large-scale datacenter networks.
Journal ArticleDOI

Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing

TL;DR: In this article, the authors present a new network algorithm, Othello hashing, and its application of a forwarding information base (FIB) design called concise, which uses very little memory to support ultrafast lookups of network names.
Proceedings ArticleDOI

It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities

TL;DR: This paper proposes a continuous-time mathematical programming approach to solve the temporal VNet embedding problem (TVNEP), and presents the CSM-Model which incorporates both symmetry and state-space reductions to significantly speed up the process of computing exact solutions to the TVNEP.
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)