CONGA: Distributed Congestion-Aware Load Balancing for Datacenters

Similar documents
Alizadeh, M. et al., " CONGA: distributed congestion-aware load balancing for datacenters," Proc. of ACM SIGCOMM '14, 44(4): , Oct

Expeditus: Congestion-Aware Load Balancing in Clos Data Center Networks

CONGA: Distributed Congestion-Aware Load Balancing for Datacenters

Let It Flow Resilient Asymmetric Load Balancing with Flowlet Switching

CONGA: Distributed Congestion-Aware Load Balancing for Datacenters

Micro load balancing in data centers with DRILL

Building Efficient and Reliable Software-Defined Networks. Naga Katta

Waze: Congestion-Aware Load Balancing at the Virtual Edge for Asymmetric Topologies

Per-Packet Load Balancing in Data Center Networks

Advanced Computer Networks. Datacenter TCP

DeTail Reducing the Tail of Flow Completion Times in Datacenter Networks. David Zats, Tathagata Das, Prashanth Mohan, Dhruba Borthakur, Randy Katz

6.888: Lecture 4 Data Center Load Balancing

HULA: Scalable Load Balancing Using Programmable Data Planes

Expeditus: Congestion-aware Load Balancing in Clos Data Center Networks

Towards a Robust Protocol Stack for Diverse Wireless Networks Arun Venkataramani

Hashing on broken assumptions

DIBS: Just-in-time congestion mitigation for Data Centers

A NEW APPROACH TO STOCHASTIC SCHEDULING IN DATA CENTER NETWORKS

ALB: Adaptive Load Balancing Based on Accurate Congestion Feedback for Asymmetric Topologies

Information-Agnostic Flow Scheduling for Commodity Data Centers

CE693: Adv. Computer Networking

I Commands. iping, page 2 iping6, page 4 itraceroute, page 5 itraceroute6 vrf, page 6. itraceroute vrf encap vxlan, page 12

Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes

CLOVE: How I Learned to Stop Worrying About the Core and Love the Edge

Delay Controlled Elephant Flow Rerouting in Software Defined Network

Network Design Considerations for Grid Computing

Information-Agnostic Flow Scheduling for Commodity Data Centers. Kai Chen SING Group, CSE Department, HKUST May 16, Stanford University

Data Center TCP (DCTCP)

pfabric: Minimal Near-Optimal Datacenter Transport

Recap. TCP connection setup/teardown Sliding window, flow control Retransmission timeouts Fairness, max-min fairness AIMD achieves max-min fairness

Lecture 15 Networking Fundamentals. Today s Plan

MPLS In Operation NANOG 39 Toronto February

KULFI. Robust Traffic Engineering Using Semi- Oblivious Routing TASTES GREAT, NO CHURN!

Implementing VXLAN in DataCenter

From Routing to Traffic Engineering

Advanced Computer Networks. Datacenter TCP

Better Never than Late: Meeting Deadlines in Datacenter Networks

A Deployable Framework for Providing Better Than Best-Effort Quality of Service for Traffic Flows

Software Defined Networking

DiffFlow: Differentiating Short and Long Flows for Load Balancing in Data Center Networks

Network Control and Signalling

CS 268: Computer Networking

The Effects of Asymmetry on TCP Performance

Configuring Flow Aware QoS

Slicing a Network. Software-Defined Network (SDN) FlowVisor. Advanced! Computer Networks. Centralized Network Control (NC)

Optical Packet Switching

Decision Forest: A Scalable Architecture for Flexible Flow Matching on FPGA

CS 268: Computer Networking. Taking Advantage of Broadcast

Forwarding Within the ACI Fabric

Multipath Transport for Virtual Private Networks

Language-Directed Hardware Design for Network Performance Monitoring

Software Defined Networks and OpenFlow. Courtesy of: AT&T Tech Talks.

Fast-Response Multipath Routing Policy for High-Speed Interconnection Networks

Packet-Based Load Balancing in Data Center Networks

IP Fabric Reference Architecture

Routing Domains in Data Centre Networks. Morteza Kheirkhah. Informatics Department University of Sussex. Multi-Service Networks July 2011

(12) Patent Application Publication (10) Pub. No.: US 2017/ A1

MIND: Machine Learning based Network Dynamics. Dr. Yanhui Geng Huawei Noah s Ark Lab, Hong Kong

Transport layer issues

IEEE P802.1Qcz Proposed Project for Congestion Isolation

Flexible NetFlow - Top N Talkers Support

Probe or Wait : Handling tail losses using Multipath TCP

Next Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points

Cisco Tetration Analytics

DATA center networks use multi-rooted Clos topologies

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Identifying Operating System Using Flow-based Traffic Fingerprinting

15-744: Computer Networking. Data Center Networking II

A Measurement Study on Multi-path TCP with Multiple Cellular Carriers on High Speed Rails

Data Center TCP (DCTCP)

Fast, Efficient, and Robust Multicast in Wireless Mesh Networks

Cloud Control with Distributed Rate Limiting. Raghaven et all Presented by: Brian Card CS Fall Kinicki

A Proposal to add Explicit Congestion Notification (ECN) to IPv6 and to TCP

pfabric: Minimal Near-Optimal Datacenter Transport

A Measurement Study on Multi-path TCP with Multiple Cellular Carriers on High Speed Rails

CS 268: Wireless Transport Protocols. Kevin Lai Feb 13, 2002

SR for SD-WAN over hybrid networks

DevoFlow: Scaling Flow Management for High Performance Networks

DARD: A Practical Distributed Adaptive Routing Architecture for Datacenter Networks

Switchgear Innovations w/cavium-xpliant. Albert Fishman, Solutions Product Marketing Manager

Lesson 9 OpenFlow. Objectives :

The Measurement Manager Modular End-to-End Measurement Services

The Network Layer and Routers

Data center Networking: New advances and Challenges (Ethernet) Anupam Jagdish Chomal Principal Software Engineer DellEMC Isilon

Flow-Based Routing: Towards New QoS Models Dr. Riad Hartani Caspian Networks

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks

Utilizing Datacenter Networks: Centralized or Distributed Solutions?

Advanced Computer Networks Exercise Session 7. Qin Yin Spring Semester 2013

Brocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz

IX: A Protected Dataplane Operating System for High Throughput and Low Latency

Flow-Based per Port-Channel Load Balancing

Lecture 15: Datacenter TCP"

XCo: Explicit Coordination for Preventing Congestion in Data Center Ethernet

Multipath QUIC: Design and Evaluation

Routing in a Delay Tolerant Network

Transport Protocols for Data Center Communication. Evisa Tsolakou Supervisor: Prof. Jörg Ott Advisor: Lect. Pasi Sarolahti

Introduction to MPLS APNIC

Software-Defined Networking (Continued)

Subject: Adhoc Networks

SDN-based Network Obfuscation. Roland Meier PhD Student ETH Zürich

Transcription:

CONGA: Distributed Congestion-Aware Load Balancing for Datacenters By Alizadeh,M et al. Motivation Distributed datacenter applications require large bisection bandwidth Spine Presented by Andrew and Jack Leaf Motivation Distributed datacenter applications require large bisection bandwidth ECMP: hash-based hop selection without reordering F(sIP, sport, dip, dport, prot) = 0

ECMP Problem: hash collisions lead to imbalance F(0, 0, 3, 0, TCP) = 0 F(0, 1, 4, 0, TCP) = 0 ECMP Problem: local decisions oblivious to downstream asymmetry MPTCP: split flows into sub-flows MPTCP Problem: higher congestion at edge

MPTCP Problem: transport layer-specific CONGA: Congestion Aware Balancing Network load-balancing without transport layer interference Make globally optimal load-balancing decisions Use common datacenter network features (e.g., overlay networks) MPTCP MPTCP MPTCP MPTCP CONGA Overview Track end-to-end congestion along path Feedback loop between leaf switches: relay congestion information Leaf switches send traffic on least congested path CONGA Design Goals 1. Responsive 2. Transport independent 3. Robust to asymmetry 4. Incrementally deployable 5. Optimized for Leaf-Spine

CONGA Design CONGA Design Distributed load-balancing is highly responsive, near optimal for regular topologies CONGA Design

CONGA Design Global congestion awareness is necessary to handle network asymmetry Global congestion awareness is necessary to handle network asymmetry Global congestion awareness is necessary to handle network asymmetry

CONGA Design Overlay networks allow leaf switches to know destination leaf and carry congestion metrics Overlay networks allow leaf switches to know destination leaf and carry congestion metrics Overlay networks allow leaf switches to know destination leaf and carry congestion metrics X

Overlay networks allow leaf switches to know destination leaf and carry congestion metrics Overlay networks allow leaf switches to know destination leaf and carry congestion metrics X CONGA Design Packet-granularity scheduling can result in reordering modifications to end-host TCP P0 P1

Packet-granularity scheduling can result in reordering modifications to end-host TCP Packet-granularity scheduling can result in reordering modifications to end-host TCP P0 P0 P1 P1 Packet-granularity scheduling can result in reordering modifications to end-host TCP Packet-granularity scheduling can result in reordering modifications to end-host TCP P0 P1 P0 P1

Flowlet: break apart flow based on delayed bursts Route separately if gap > d 1 - d 2 d 1 d 2 gap Overlay packet header contains CONGA metadata LBTag: src port CE: path congestion FB_LBTag: fb dst port FB_Metric: reported cong. X

Discounting Rate Estimator (DRE) Discounting Rate Estimator (DRE) X: register quantifying load Additive increase by bytes sent for each packet Multiplicative decrease every T dre by α X X * (1 - α) More responsive to traffic bursts than EWMA

Flowlet Detection T fl : flowlet inactivity gap Hash flowlets based on 5-tuple Collision is not a correctness issue Round-based aging LB decisions made based on first packet New flowlet: choose uplink minimizing the max local metric Port: Valid: Age: Implementation: custom ASICs rather than software to reduce overreaction, oscillations Implementation: custom ASICs rather than software to reduce overreaction, oscillations

Evaluation 1. How does CONGA impact flow completion times (FCT) vs. state of the art? 2. How does CONGA perform under the impact of failed links? 3. Does CONGA perform well on real-world traffic? Experimental Setup Compared CONGA, CONGA-FLOW, ECMP and MPTCP Baseline Performance Two Workloads: Enterprise and Data-mining Baseline Performance Breakdown: Short Flows and Long Flows

Link Failure Incast HDFS Benchmark Analytical Evaluation Worst-Case performance: The ratio between the most congested link in CONGA and the best possible assignment of flows is 2.

Analytical Evaluation What is the expected traffic imbalance? How does it depend on workload? Analytical Evaluation What is the expected traffic imbalance? How does it depend on workload? Less imbalance with many small flows, more imbalance with fewer large flows Conclusion CONGA: globally aware datacenter load balancing - No transport layer intervention Discussion Leaf-Spine topology has each leaf only two hops apart - Significant performance degrade if implemented in software? - Extensible to larger, multi-layered topologies? Implemented in custom ASICs Better flow completion times than ECMP, Incast MPTCP