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
Journal ArticleDOI
Strict-sense nonblocking networks with k degrees of freedom
TL;DR: The strict-sense nonblocking conditions for the three-stage Clos network with k degrees offreedom are proved and the cost of switching fabrics of selected capacities and with three degrees of freedom in terms of the required number of elements is analyzed.
Proceedings ArticleDOI
SEA: Stable Resource Allocation in Geographically Distributed Clouds
TL;DR: This paper is the first attempt at gaining a better understanding of the structure of the Stable rEsource Allocation (SEA) problem and develops two algorithms for the 1-dimensional (1-D) and 2-D cases, respectively.
Proceedings ArticleDOI
An Energy-Efficient, Wireless Top-of-Rack to Top-of-Rack Datacenter Network Using 60GHz Links
Sayed Ashraf Mamun,Sree Gowrishankar Umamaheswaran,Siva Shankar Chandrasekaran,Md. Shahriar Shamim,Amlan Ganguly,Minseok Kwon +5 more
TL;DR: It is found that the ToR-to-ToR wireless datacenter network (DCN) can sustain similar data rates for typical query based applications and consume less power compared to that of traditional datacenters.
Journal ArticleDOI
Fair Scheduling and Rate Control for Service Function Chain in NFV Enabled Data Center
TL;DR: A Nash bargaining based model is proposed to jointly optimize the latency and throughput and a polynomial two-phase heuristic to perform Pareto optimization is designed to improve the scalability of the proposed algorithm.
Proceedings ArticleDOI
DistributedNet: A reasonable pricing and flexible network architecture for datacenter
Yong Zhan,Du Xu,Yiqi Ou +2 more
TL;DR: This paper aims at designing a decentralized resource allocation method and a dynamic pricing policy based on network state and tenant demands and shows that DistributedNet can provide performance isolation, differentiated service and min-bandwidth guarantee.
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.