Sharing Cloud Networks Lucian Popa, Gautam Kumar, Mosharaf Chowdhury Arvind Krishnamurthy, Sylvia Ratnasamy, Ion Stoica UC Berkeley.

Slides:



Advertisements
Similar presentations
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Advertisements

Towards Predictable Datacenter Networks
Internet Protocols Steven Low CS/EE netlab.CALTECH.edu October 2004 with J. Doyle, L. Li, A. Tang, J. Wang.
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.
Lucian Popa Minlan Yu Steven Y. Ko UC Berkeley/ICSI Princeton Univ. Princeton Univ. Sylvia Ratnasamy Ion Stoica Intel Labs Berkeley UC Berkeley CloudPolice:
Stratos: A Network-Aware Orchestration Layer for Middleboxes in the Cloud Aditya Akella, Aaron Gember, Anand Krishnamurthy, Saul St. John University of.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Cloud Control with Distributed Rate Limiting Barath Raghavan, Kashi Vishwanath, Sriram Ramabhadran, Kenneth Yocum, and Alex C. Snoeren University of California,
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Look Who’s Talking: Discovering Dependencies between Virtual Machines Using CPU Utilization HotCloud 10 Presented by Xin.
FairCloud: Sharing the Network in Cloud Computing Computer Communication Review(2012) Arthur : Lucian Popa Arvind Krishnamurthy Sylvia Ratnasamy Ion Stoica.
Reciprocal Resource Fairness: Towards Cooperative Multiple-Resource Fair Sharing in IaaS Clouds School of Computer Engineering Nanyang Technological University,
My Point of View about Bandwidth Sharing Bin Wang.
A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks John C.S. Lui The Chinese University of Hong Kong Joint work.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
Enable Multi Tenant Clouds Network Virtualization. Dynamic VM Placement. Secure Isolation. … High Scale & Low Cost Datacenters Leverage Hardware. High.
DRFQ: Multi-Resource Fair Queueing for Packet Processing Ali Ghodsi 1,3, Vyas Sekar 2, Matei Zaharia 1, Ion Stoica 1 1 UC Berkeley, 2 Intel ISTC/Stony.
TitleEfficient Timing Channel Protection for On-Chip Networks Yao Wang and G. Edward Suh Cornell University.
ElasticTree: Saving Energy in Data Center Networks 許倫愷 2013/5/28.
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
Network Sharing Issues Lecture 15 Aditya Akella. Is this the biggest problem in cloud resource allocation? Why? Why not? How does the problem differ wrt.
Sharing the Data Center Network Alan Shieh, Srikanth Kandula, Albert Greenberg, Changhoon Kim, Bikas Saha Microsoft Research, Cornell University, Windows.
Bargaining Towards Maximized Resource Utilization in Video Streaming Datacenters Yuan Feng 1, Baochun Li 1, and Bo Li 2 1 Department of Electrical and.
Algorithms for Provisioning Virtual Private Networks in the Hose Model Source: Sigcomm 2001, to appear in IEEE/ACM Transactions on Networking Author: Amit.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
Networking the Cloud Presenter: b 電機三 姜慧如.
Network Aware Resource Allocation in Distributed Clouds.
DRFQ: Multi-Resource Fair Queueing for Packet Processing Ali Ghodsi 1,3, Vyas Sekar 2, Matei Zaharia 1, Ion Stoica 1 1 UC Berkeley, 2 Intel ISTC/Stony.
E VALUATION OF F AIRNESS IN ICN X. De Foy, JC. Zuniga, B. Balazinski InterDigital
Link Scheduling & Queuing COS 461: Computer Networks
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion.
Scalable Multi-Class Traffic Management in Data Center Backbone Networks Amitabha Ghosh (UtopiaCompression) Sangtae Ha (Princeton) Edward Crabbe (Google)
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Towards Economic Fairness for Big Data Processing in Pay-as-you-go Cloud Computing Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
Surviving Failures in Bandwidth Constrained Datacenters Authors: Peter Bodik Ishai Menache Mosharaf Chowdhury Pradeepkumar Mani David A.Maltz Ion Stoica.
A Case for Performance- Centric Network Allocation Gautam Kumar, Mosharaf Chowdhury, Sylvia Ratnasamy, Ion Stoica UC Berkeley.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Resource Allocation in Network Virtualization Jie Wu Computer and Information Sciences Temple University.
L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04, 2004 Presented by Alok Rakkhit, Ionut Trestian.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
Slides by Yong Liu1, Deep Medhi2, and Michał Pióro3
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
Presented by Qifan Pu With many slides from Ali’s NSDI talk Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica.
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types Ali Ghodsi, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion.
6.888 Lecture 6: Network Performance Isolation Mohammad Alizadeh Spring
1 Transport Bandwidth Allocation 3/29/2012. Admin. r Exam 1 m Max: 65 m Avg: 52 r Any questions on programming assignment 2 2.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
Aalo Efficient Coflow Scheduling Without Prior Knowledge Mosharaf Chowdhury, Ion Stoica UC Berkeley.
Data Center Network Architectures
Cloud-Assisted VR.
Improving Datacenter Performance and Robustness with Multipath TCP
CS 425 / ECE 428 Distributed Systems Fall 2016 Nov 10, 2016
TCP Congestion Control
CS 425 / ECE 428 Distributed Systems Fall 2017 Nov 16, 2017
Cloud-Assisted VR.
TCP Congestion Control
TCP-LP: A Distributed Algorithm for Low Priority Data Transfer
CloudMirror: Application-Driven Bandwidth Guarantees in Datacenters
EE 122: Lecture 7 Ion Stoica September 18, 2001.
TCP Congestion Control
Towards Predictable Datacenter Networks
Presentation transcript:

Sharing Cloud Networks Lucian Popa, Gautam Kumar, Mosharaf Chowdhury Arvind Krishnamurthy, Sylvia Ratnasamy, Ion Stoica UC Berkeley

State of the Cloud Network??? 2

Guess the Share 3 B2B2 A1A1 B1B1 A2A2 A3A3 Link L Alice : Bob = ? : ? 3 : 11 : 12 : 13 : 2 TCP Per flowPer Source Per Destination Per-VM Proportional

Challenges Network share of a virtual machine (VM) V depends on »Collocated VMs, »Placement of destination VMs, and »Cross-traffic on each link used by V Network differs from CPU or RAM »Distributed resource »Usage attribution (source, destination, or both?) Traditional link sharing concepts needs rethinking 4

Requirements 5 High Utilization Min Bandwidth Guarantee Aggregate Proportionality Network shares proportional to the number of VMs Introduce performance predictability Do not leave bandwidth unused if there is demand

Requirement 1: Guaranteed Minimum B/W Provides a minimum b/w guarantee for each VM Captures the desire of tenants to get performance isolation for their applications 6 ABX B minA B minB B minX … All VMs

Requirement 2: Aggregate Proportionality Shares network resources across tenants in proportion to the number of their VMs Captures payment-proportionality »Similar to other resources like CPU, RAM etc. Desirable properties »Strategy-proofness: Allocations cannot be gamed »Symmetry: Reversing directions of flows does not change allocation 7

Design Space 8 High Utilization Min Bandwidth Guarantee Aggregate Proportionality Strategy- Proofness Symmetry

Requirement 3: High Utilization Provides incentives such that throughput is only constrained by the network capacity »Not by the inefficiency of the allocation or by disincentivizing users to send traffic Desirable properties »Work Conservation: Full utilization of bottleneck links »Independence: Independent allocation of one VM’s traffic across independent paths 9

Tradeoff 1 Design Space 10 High Utilization Min Bandwidth Guarantee Aggregate Proportionality Work Conservation Strategy- Proofness IndependenceSymmetry

Tradeoff 1: Min B/W vs. Proportionality 11 Share of Tenant A can decrease arbitrarily! B2 A1 B1 A2 Link L with Capacity C C/2 B3 C/3 2C/3

Tradeoff 1 Tradeoff 2 Design Space 12 High Utilization Min Bandwidth Guarantee Aggregate Proportionality Work Conservation Strategy- Proofness IndependenceSymmetry

Tradeoff 2: Proportionality vs. Utilization 13 A1A1 A3A3 B1B1 B3B3 A2A2 A4A4 B2B2 B4B4 Link L with Capacity C C/4 To maintain proportionality, equal amount of traffic must be moved from A1-A2 to A1-A3 => Underutilization of A1-A3

Per-link Proportionality Restrict to congested links only Share of a tenant on a congested link is proportional to the number of its VMs sending traffic on that link 14

Per Endpoint Sharing (PES) Five identical VMs (with unit weights) sharing a Link L 15 B2B2 A1A1 B1B1 A2A2 A3A3 Link L

Per Endpoint Sharing (PES) Resulting weights of the three flows: 16 Link L 3/2 2 To generalize, weight of a flow A-B on link L is.. WAWA W A-B = NANA NBNB WBWB + N A = 2 B2B2 A1A1 B1B1 A2A2 A3A3

Per Endpoint Sharing (PES) Symmetric Proportional »sum of weights of flows of a tenant on a link L = sum of weights of its VMs communicating on that link Work Conserving Independent Strategy-proof on congested links 17 WAWA W A-B = NANA NBNB WBWB + = W B-A

Generalized PES 18 AB α > β if L is more important to A than to B (e.g., A’s access link) WAWA W A-B = W B-A = α NANA NBNB WBWB + β+ β L Scale weight of A by α Scale weight of B by β

One-Sided PES (OSPES) 19 AB α = 1, β = 0 if A is closer to L α = 0, β = 1 if B is closer to L WAWA W A-B = W B-A = α NANA NBNB WBWB + β+ β L Scale weight of A by α Scale weight of B by β Per Source closer to source Per Destination closer to destination Highest B/W Guarantee *In the Hose Model

Comparison 20 Per Flow Per Source Static Reservation Link PESOSPES Link Proportionality   Symmetry ✓✗✓✓✓  Strategy-Proofness ✗✓✓✓✓ Utilization   Independence ✓✓✓✓✓  Work Conservation ✓✓✗✓✓ B/W Guarantee 

Full-bisection B/W Network 21 Tenant 1 has one-to-one communication pattern Tenant 2 has all-to-all communication pattern OSPES

MapReduce Workload 22 W1:W2:W3:W4:W5 = 1:2:3:4:5 OSPES

Summary Sharing cloud networks is all about making tradeoffs »Min b/w guarantee VS Proportionality »Proportionality VS Utilization Desired solution is not obvious »Depends on several conflicting requirements and properties »Influenced by the end goal 23