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 Live Migration Algorithm for Containers Based on Resource Locality

TL;DR: This paper presents the locality live migration model where the distance, available bandwidth and costs between containers are taken into account, and shows that the proposed method improves the utilization of resources of servers, and also improves the balance of all kinds of resources on the physical machine.
Proceedings ArticleDOI

Network aware virtual machine and image placement in a cloud

TL;DR: This paper model this problem as a novel placement problem that extends the class constrained multiple knapsack problem (CCMK) previously studied in the literature, and presents a polynomial time local search algorithm for the case where all the relevant images have the same size.
Journal ArticleDOI

A Multi-Objective Ant Colony System Algorithm for Virtual Machine Placement in Traffic Intense Data Centers

TL;DR: This paper proposes a multi-objective Ant Colony System (ACS) algorithm which is called ACS-BVMP, which can simultaneously maximize the revenue of communications and minimize the power consumption of PMs in cloud applications.
Journal ArticleDOI

Dynamic Distributed Flow Scheduling with Load Balancing for Data Center Networks

TL;DR: A Dynamic Distributed Flow Scheduling (DDFS) mechanism that will lead to fair link utilization in globally used fat-tree topology of DCN and a mechanism to restrict the flow scheduling de- cisions to the lower layers thus avoiding saturation of core switches is presented.
Proceedings ArticleDOI

Near-optimal virtual machine placement with product traffic pattern in data centers

TL;DR: This paper considers the VM placement problem with product traffic in data centers that follow the Clique or VL2 architecture, and presents an optimal solution for the special case where all the physical machines (PMs) connect to the same switch, and develops a simple yet efficient algorithm for the general case.
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)