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
Proceedings ArticleDOI
In-network computing to the rescue of faulty links
Hans Giesen,Lei Shi,John Sonchack,Anirudh Chelluri,Nishanth Prabhu,Nik Sultana,Latha Kant,Anthony McAuley,Alexander Poylisher,André DeHon,Boon Thau Loo +10 more
TL;DR: A new network function is described that relies on in-network computing to limit the erratic effect of failing network links, to enable the continued use of those links until they can be repaired.
Journal ArticleDOI
A Power Load Distribution Algorithm to Optimize Data Center Electrical Flow
TL;DR: The present paper proposes a power load distribution algorithm (PLDA) to optimize energy distribution of data center power infrastructures, based on the Ford-Fulkerson algorithm, which optimizes the flow distribution of the energy flow model (EFM).
Journal ArticleDOI
Experimental Framework for Mobile Cloud Computing System
TL;DR: A modeling and simulation environment for mobile cloud computing that can exploit CloudExp capabilities to simulate big data generation and processing scenarios and an experimental scenario is introduced to demonstrate the capabilities of the proposed framework.
Journal ArticleDOI
Towards cost-effective and low latency data center network architecture
TL;DR: PORA is a both deadlock and livelock free routing algorithm, which achieves near-optimal performance in terms of average routing path length with better load balancing thus leading to higher throughput.
Book ChapterDOI
A Periodic Portfolio Scheduler for Scientific Computing in the Data Center
TL;DR: This work designs a periodic portfolio scheduler for the workload of the entire data center, and equip it with a portfolio of resource provisioning and allocation policies, and shows evidence that portfolio scheduling can automatically select the scheduling policy to match both user and data center objectives, and that it can perform well in the data center.
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.