Packet implementation: discretization Rates Control: or.

Slides:

Advertisements

Similar presentations

Helping TCP Work at Gbps Cheng Jin the FAST project at Caltech

Advertisements

Connection-level Analysis and Modeling of Network Traffic understanding the cause of bursts control and improve performance detect changes of network state.

One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM’ 05, Philadelphia, PA 08 / 23 / 2005.

Cheng Jin David Wei Steven Low FAST TCP: design and experiments.

CS 268: Lecture 7 (Beyond TCP Congestion Control) Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University.

Active Queue Management: Theory, Experiment and Implementation Vishal Misra Dept. of Computer Science Columbia University in the City of New York.

Router-assisted congestion control Lecture 8 CS 653, Fall 2010.

Mohammad Alizadeh Adel Javanmard and Balaji Prabhakar Stanford University Analysis of DCTCP:Analysis of DCTCP: Stability, Convergence, and FairnessStability,

Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.

Modeling TCP Congestion Control Don Towsley UMass Amherst collaborators: T. Bu, W. Gong, C. Hollot, V. Misra.

XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.

One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,

The War Between Mice and Elephants Liang Guo and Ibrahim Matta Boston University ICNP 2001 Presented by Thangam Seenivasan 1.

The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP

Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,

Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley and Charlie Rohrs SIGCOMM2002 Pittsburgh Presenter – Bob Kinicki.

“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.

Control Theory in TCP Congestion Control and new “FAST” designs. Fernando Paganini and Zhikui Wang UCLA Electrical Engineering July Collaborators:

Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.

Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.

End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.

Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.

Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.

High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.

WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras, Vassilis Tsaoussidis Demokritos University of Thrace, Xanthi, Greece.

1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp

1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.

TCP Westwood (with Faster Recovery) Claudio Casetti Mario Gerla Scott Seongwook Lee Saverio.

1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.

Data Communication and Networks

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 Aug 19th / 2004 Rafael Nunez.

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.

1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,

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,

TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.

Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!

UDT: UDP based Data Transfer Yunhong Gu & Robert Grossman Laboratory for Advanced Computing University of Illinois at Chicago.

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.

Addressing Queuing Bottlenecks at High Speeds Sailesh Kumar Patrick Crowley Jonathan Turner.

High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.

Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.

Self-generated Self-similar Traffic Péter Hága Péter Pollner Gábor Simon István Csabai Gábor Vattay.

Murari Sridharan and Kun Tan (Collaborators: Jingmin Song, MSRA & Qian Zhang, HKUST.

Recent Congestion Control Research at UCLA Presenter: Cesar Marcondes PhD Candidate CS/UCLA Chicago, July IRTF/ICCRG Meeting Presenter: Cesar Marcondes.

WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras Demokritos University of Thrace, Xanthi, Greece.

 Last Class  This Class  Chapter 6.3. ~ 6.4.  TCP congestion control.

Network teleology Damon Wischik

Scalable Laws for Stable Network Congestion Control Fernando Paganini UCLA Electrical Engineering IPAM Workshop, March Collaborators: Steven Low,

Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.

Murari Sridharan Windows TCP/IP Networking, Microsoft Corp. (Collaborators: Kun Tan, Jingmin Song, MSRA & Qian Zhang, HKUST)

XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science

Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.

ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.

1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,

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.

1 Network Transport Layer: TCP Analysis and BW Allocation Framework Y. Richard Yang 3/30/2016.

Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.

CS 268: Lecture 6 Scott Shenker and Ion Stoica

Presented by LINGLING MENG( ), XUN XU( )

Random Early Detection Gateways for Congestion Avoidance

Packet implementation: discretization

FAST TCP : From Theory to Experiments

Understanding Congestion Control Mohammad Alizadeh Fall 2018

Presentation transcript:

Packet implementation: discretization Rates Control: or

Window dynamics: Packet implementation: discretization Equilibrium: ECN based price control: Link: Source: Shift-register to save the last N ECN bits

Packet implementation: Source Side

Packet implementation: Link Side

Ns Simulation: two-way, long-lived traffic 2Gbps, delay=20ms 32 ftps 64ftps 128 ftps 256 ftps 32 ftps 64ftps 128 ftps 256 ftps Duplex links td1 td2 td3 td4 td5 td2 td3 td4 td5 td_i=(i-1)*10ms 2^6, 2^6, 2^7,2^8,2^9 sources started at 0, 20, 40, 60, 80 seconds RTTs 40, 80,120,160, 200ms,link capacity 2Gbps (250pkts/ms) Scenario:

Ns Simulation: two-way, long-lived traffic Marking Prob Utilization Estimated Prob Queue Cwnds Rates (pkts) (pkts/sec) New Protocol

NewReno/REDNewReno/AdaptiveRED Utilization Queue Cwnds (pkts) Utilization Queue Cwnds (pkts) Ns Simulation: two-way, long-lived traffic Paremeters: Thresh_ 100, maxthresh_ 2500

NewReno/VQ Utilization Queue Cwnds (pkts) Utilization Queue Cwnds (pkts) NewReno/PI Ns Simulation: two-way, long-lived traffic Paremeters: qref_=100

Ns Simulation: small marking Prob Marking Prob Utilization Estimated Prob Queue Cwnds Rates (pkts) (pkts/sec) New Protocol

Power law Pareto law lognormal: log X normally distr., (q,s,m) Ns Simulation: “heavy-tailed” traffic Long/heavy-tailed distributions Crovella data set, files

Ns Simulation: “heavy-tailed” traffic flow size(pkts, log2(x)) Ex: Pareto(100,1.0) Count contribution of the flows packet contribution of the flows flows 3.33e+7 pkts Median size 200.5pkts Prob(X<x) Log2(Prob[X>x]) Pareto(scale,shape):

Marking Prob Utilization Queue Cwnds Scenario: 1024 sources started at [0,10] with RTT 100ms, link capacity 1Gbps (125pkts/ms) Percentage of the sessions Percentage of the packets Flow size (log2(x)) Cumulative Distribution of the flows Ns Simulation: “heavy-tailed” traffic New Protocol

Marking Prob Utilization Queue Cwnds (pkts) Percentage of the sessions Percentage of the packets Flow size (log2(x)) Cumulative Distribution of the flows Scenario: 2^6, 2^6, 2^7,2^8,2^9 sources started uniformly in [0,10] secs with RTTs 40, 80, 120,160, 200ms,link capacity 1Gbps (125pkts/ms) Ns Simulation: “heavy-tailed” traffic New Protocol

Utilization Queue Cwnds (pkts) Utilization Queue Cwnds (pkts) Ns Simulation: “heavy-tailed” traffic NewReno/REDNewReno/AdaptiveRED Paremeters: Thresh_ 100, maxthresh_ 2500

NewReno/VQ NewReno/PI Utilization Queue Cwnds (pkts) Utilization Queue Cwnds (pkts) Ns Simulation: “heavy-tailed” traffic

Packet implementation: tricks ? Window management Price estimation: Pacing output Capping the change of the cwnd Penalizing the real queue above a threshold Smoothing the average arrival rate of the queue

Conclusion: Equation-based implementation has the desirable performance. --scalable stable, fair, high utilization, small queue --especially for the high bandwidth links Price feedback and estimation is the main obstacle. Improvement may be made to be more efficient. To be done packet-drop and timeout -- optimal parameter set -- new price estimation and transmission scheme -- more practical implementation

Packet implementation: Source Side

Ns Simulation: “heavy-tail” traffic