Balaji Prabhakar Mohammad Alizadeh, Abdul Kabbani, and Berk Atikoglu Stanford University Stability Analysis of QCN:Stability Analysis of QCN: The Averaging.

Slides:



Advertisements
Similar presentations
Balaji Prabhakar Active queue management and bandwidth partitioning algorithms Balaji Prabhakar Departments of EE and CS Stanford University
Advertisements

Congestion Management for Data Centers: IEEE Ethernet Standard
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
1 TCP Congestion Control. 2 TCP Segment Structure source port # dest port # 32 bits application data (variable length) sequence number acknowledgement.
CS 268: Lecture 7 (Beyond TCP Congestion Control) Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University.
Stability of computer network for the set delay Jolanta Tańcula.
Restricted Slow-Start for TCP William Allcock 1,2, Sanjay Hegde 3 and Rajkumar Kettimuthu 1,2 1 Argonne National Laboratory 2 The University of Chicago.
Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Presented by Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,
REM : Active Queue Management Sanjeewa Athuraliya, Victor H. Li Steven H. Low, Qinghe Yin Presented by Hwangnam Kim.
Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
1 Multi-layer Active Queue Management and Congestion Control for Scalable Video Streaming Kang, S.-R.; Zhang, Y.; Dai, M.; Loguinov, D.; Distributed Computing.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
Transport Layer 3-1 outline r TCP m segment structure m reliable data transfer m flow control m congestion control.
Transport Layer 3-1 Outline r TCP m Congestion control m Flow control.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
6/16/20151 On Designing Improved Controllers for AQM Routers Supporting TCP flows By C.V Hollot, Vishal Mishra, Don Towsley and Wei-Bo Gong Presented by.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
1 Lecture 9: TCP and Congestion Control Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3.
Congestion Avoidance and Control Van Jacobson Jonghyun Kim April 1, 2004.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
1 Chapter 3 Transport Layer. 2 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4.
ACN: AVQ1 Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Managment Srisankar Kunniyur and R. Srikant SIGCOMM’01 San.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Random Early Detection Gateways for Congestion Avoidance
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.
On Horrible TCP Performance over Underwater Links Balaji Prabhakar Abdul Kabbani, Balaji Prabhakar Stanford University.
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Curbing Delays in Datacenters: Need Time to Save Time? Mohammad Alizadeh Sachin Katti, Balaji Prabhakar Insieme Networks Stanford University 1.
Congestion models for bursty TCP traffic Damon Wischik + Mark Handley University College London DARPA grant W911NF
Data Center Transport Mechanisms Joint work with: Mohammad Alizadeh, Berk Atikoglu and Abdul Kabbani, Stanford University Ashvin Lakshmikantha, Broadcom.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.
Link Scheduling & Queuing COS 461: Computer Networks
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
MaxNet NetLab Presentation Hailey Lam Outline MaxNet as an alternative to TCP Linux implementation of MaxNet Demonstration of fairness, quick.
High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
A Self-Configuring RED Gateway Wu-chang Feng, Dilip Kandlur, Debanjan Saha, Kang Shin INFOCOM ‘99.
1 Time-scale Decomposition and Equivalent Rate Based Marking Yung Yi, Sanjay Shakkottai ECE Dept., UT Austin Supratim Deb.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
An overview and a proposal Jan 24, 2007 Balaji Prabhakar Stanford University.
Scalable Laws for Stable Network Congestion Control Fernando Paganini UCLA Electrical Engineering IPAM Workshop, March Collaborators: Steven Low,
Time-Dependent Dynamics in Networked Sensing and Control Justin R. Hartman Michael S. Branicky Vincenzo Liberatore.
Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.
XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science
HP Labs 1 IEEE Infocom 2003 End-to-End Congestion Control for InfiniBand Jose Renato Santos, Yoshio Turner, John Janakiraman HP Labs.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.
Internet Networking recitation #9
Chapter 3 outline 3.1 transport-layer services
CS 268: Lecture 6 Scott Shenker and Ion Stoica
Congestion Control: The Role of the Routers
Router-Assisted Congestion Control
Internet Networking recitation #10
Stability of Congestion Control Algorithms Using Control Theory with an application to XCP Ioannis Papadimitriou George Mavromatis.
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Presentation transcript:

Balaji Prabhakar Mohammad Alizadeh, Abdul Kabbani, and Berk Atikoglu Stanford University Stability Analysis of QCN:Stability Analysis of QCN: The Averaging PrincipleThe Averaging Principle

Outline Quantized Congestion Notification – L2 congestion control developed for IEEE802.11Qau – Fluid model – Linear control analysis The Averaging Principle – A method for improving robustness of control loops to lag – QCN benefits from the AP 2

Background: Layer 2 Congestion ControlBackground: Layer 2 Congestion Control Ethernet is the dominant Layer 2 network technology The 802.1Qbb standard allows per-priority PAUSE – No packet drops – Congestion spreading can occur The 802.1Qau standard allows Ethernet switches to directly signal congestion to Ethernet sources (NICs) – We’ve been involved in developing QCN (Quantized Congestion Notification) for the IEEE 802.1Qau standard 3

Congestion control in the InternetCongestion control in the Internet At the router: DropTail, RED signal congestion by dropping or marking packets using ECN At the sender: TCP varies the sending rate Rich history of algorithm development, control-theoretic analysis and detailed simulation of queue management schemes – Jacobson, Floyd et al, Kelly et al, Low et al, Srikant et al, Misra et al, Katabi et al … 4

Ethernet vs. the InternetEthernet vs. the Internet Some significant differences … 1.No per-packet ACKs in Ethernet, unlike in the Internet Not possible to know round trip time So congestion must be signaled to the source by switches Algorithm not self-clocked 2.Sources do not start transmission gently (like TCP slow-start); they can potentially come on at the full line rate of 10Gbps 3.Ethernet switch buffers are much smaller than router buffers (100s of KBs vs 100s of MBs) 4.Algorithm should be simple enough to be implemented completely in hardware – Note: QCN has Internet relatives---BIC-TCP at the source and the REM/PI queue management schemes 5

Feedback Stabilization in High BDP Networks In “high BDP” environments, congestion control loops become oscillatory. – Need feedback stabilization Two main flavors of feedback stabilization: 1.Determine lags (round trip times), apply the correct “gains” (e.g. FAST, XCP, RCP, HS-TCP). 2.Include higher order queue derivatives of congestion information (e.g. REM/PI, XCP, RCP). We shall see that BIC-TCP and QCN use a different method which we call the Averaging Principle. First, we describe the QCN algorithm. 6

QCN

Congestion Point S ND 1D NS 1 Reaction Points Feedback The QCN Control LoopThe QCN Control Loop 8

QCN Congestion PointQCN Congestion Point Consider the single-source, single-switch loop below Congestion Point (Switch) Dynamics: Sample packets, compute feedback (Fb), quantize Fb to 6 bits, and reflect only negative Fb values back to Reaction Point. Source Q eq Fb = −(Q-Q eq + w. dQ/dt ) = −(queue offset + w.rate offset) Fb = −(Q-Q eq + w. dQ/dt ) = −(queue offset + w.rate offset) 9

QCN Reaction PointQCN Reaction Point Time Rate Current Rate Congestion message recd D D/2 D/4 D/8 Target Rate RCRC RTRT Active Increase Fast Recovery R AI 10

Fluid Model for QCNFluid Model for QCN Assume N flows pass through a single queue at a switch. The State variables are R T (t), R C (t), q(t). 11

Accuracy: model vs. simulationAccuracy: model vs. simulation 12

Linear Control AnalysisLinear Control Analysis Linearization around fixed point: 13 - all constants depend on C, N, p s, G d, R AI, w Characteristic Equation

QCN Stability Margin (Linear Analysis) Using the Bodé criterion, we obtain: 14 The QCN control loop is (locally) stable if: The QCN control loop is (locally) stable if: - ω *, b, β, ϒ are known constants depending on C, N, p s, G d, R AI, w.

Summary The algorithm has been extensively tested in deployment scenarios of interest – Esp. interoperability with link-level PAUSE and TCP The linear control theoretic analysis gives stability margins, but doesn’t provide any insight as to why QCN (and BIC-TCP) display strong stability in the face of increasing lags. While attempting to understand this, we have uncovered a general method for improving the stability of congestion control schemes; we present this next 15

The Averaging PrincipleThe Averaging Principle 16

The Averaging Principle (AP)‏The Averaging Principle (AP)‏ A controller (source) is instructed periodically to adjust the input signal (sending rate) to the plant (switch queue). AP: controller obeys the feedback, and then voluntarily performs averaging as below I T = Target Input I C = Current Input 17

A Generic Control ExampleA Generic Control Example As an example, we consider the plant transfer function: 18

Step Response Basic AP, No Delay 19

Step Response Basic AP, Delay = 8 seconds 20

Step Response Two-step AP, Delay = 14 seconds 21

Step Response Two-step AP, Delay = 25 seconds Two-step AP is even more stable than Basic AP 22

Averaging in QCNAveraging in QCN QCN ~ BIC-TCP Time Rate Congestion message recd Time Rate Current Rate Congestion message recd D D/2 D/4 D/8 Target Rate RCRC RTRT Active Increase R AI QCN-AIMD ~ TCP 23

Stability: QCN-AIMD vs QCNStability: QCN-AIMD vs QCN 24

Understanding the APUnderstanding the AP As mentioned earlier, the two major flavors of feedback compensation are: 1.Determine lags, chose appropriate gains 2.Feedback higher derivatives of state We prove that AP is in a sense equivalent to both of the above. – Very useful since we don’t need to change network switches – Also, the AP is really very easy to apply; no lag-dependent optimizations of gain parameters needed 25

Equivalence of AP and PDEquivalence of AP and PD Main Result: Systems 1 and 2 are algebraically equivalent: given identical input sequences, they produce identical output sequences. Source does AP Regular source 26 The AP is equivalent to adding a derivative and reducing the gain.

AP vs PD No Delay 27

AP vs PD Delay = 8 seconds 28

Proof of EquivalenceProof of Equivalence 29 Time Controller Output F b ((n-1)T) F b (nT) (n-1)TnT(n+1)T ? − + =

Summary of APSummary of AP The AP is a simple method for making many control loops (not just congestion control loops) more robust to increasing lags Gives an understanding as to the reason why the BIC-TCP and QCN algorithms have such good delay tolerance: they do averaging repeatedly The AP gives the stabilizing effect of a PD controller, without requiring an additional derivative to be taken at the switch. 30

31