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
Dissertation
Resource Protection in Enterprise Data Centers: Architectures and Protocols
TL;DR: In this article, the authors propose GeoDS, a geographically distributed service traffic shaping approach that considers in its design the communications delays between entities in the system and solves the multi-service traffic shaping problem in geographically distributed environments.
Video file distribution among geo-distributed cloud servers
TL;DR: This work forms this problem as a preemptive scheduling problem, proves that it is NP-hard, and design a heuristic scheduling algorithm to solve it and demonstrates that the proposed scheduling algorithm gives much smaller mean completion time than four scheduling algorithms.
Proceedings ArticleDOI
A distributed data store model satisfying sequential consistency or causal consistency with operation logs
Daisuke Kitao,Daisuke Ikeda +1 more
TL;DR: This paper proposes distributed data store model containing special nodes “casting nodes” and algorithms in order to decide an order of operations, which can satisfy sequential consistency when all networks can connect, and causal consistency when any networks disconnect.
Book ChapterDOI
On Routing Algorithms for the DPillar Data Centre Networks
TL;DR: This paper derives analytically, and validate experimentally, the average hop count and the aggregate bottleneck throughput of the DPillar networks with a focus on single-path routing algorithms and the all-to-all traffic pattern, and proposes a collection of routing algorithms which keep the simplicity of the original but enable a more effective utilisation of the network.
Posted Content
Hardness of Virtual Network Embedding with Replica Selection
TL;DR: This paper considers a scenario where physical network has a structure of a balanced tree and shows limits of optimality of embedding, which holds even in trees of edge height bounded by three.
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.