1 TCP-BFA: Buffer Fill Avoidance September 1998 Amr A. Awadallah Chetan Rai Computer Systems.

Slides:

Advertisements

Similar presentations

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

Advertisements

TCP--Revisited. Background How to effectively share the network? – Goal: Fairness and vague notion of equality Ideal: If N connections, each should get.

1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.

TCP Vegas: New Techniques for Congestion Detection and Control.

Congestion Control Algorithms: Open Questions Benno Overeinder NLnet Labs.

TCP SPC: Statistic Process Control for Enhanced Transport over Wireless Links Yantai Shu, Dawei Gao, and Li Yu Tanjn University M.Y. Sanadidi, Mario Gerla.

1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.

1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.

CUBIC Qian HE (Steve) CS 577 – Prof. Bob Kinicki.

Congestion control principles Presentation by: Farhad Rad (Advanced computer Networks Lesson in

Multirate Congestion Control Using TCP Vegas Throughput Equations Anirban Mahanti Department of Computer Science University of Calgary Calgary, Alberta.

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

Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 TCP Congestion Control: AIMD and Binomial Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.

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

1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #7 TCP New Reno Vs. Reno.

ISCSI Performance in Integrated LAN/SAN Environment Li Yin U.C. Berkeley.

TCP on High-Speed Networks Sangtae Ha and Injong Rhee North Carolina State University.

High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.

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

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.

Dynamic-CBT and ChIPS – Router Support for Improved Multimedia Performance on the Internet Jae Chung and Mark Claypool Computer Science Department Worcester.

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

Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.

Reduced TCP Window Size for VoIP in Legacy LAN Environments Nikolaus Färber, Bernd Girod, Balaji Prabhakar.

Routers with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University

Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.

Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.

CS144 An Introduction to Computer Networks

A Simulation of Adaptive Packet Size in TCP Congestion Control Zohreh Jabbari.

Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.

CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.

Raj Jain The Ohio State University R1: Performance Analysis of TCP Enhancements for WWW Traffic using UBR+ with Limited Buffers over Satellite.

Implementing High Speed TCP (aka Sally Floyd’s) Yee-Ting Li & Gareth Fairey 1 st October 2002 DataTAG CERN (Kinda!)

Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.

CSCI-1680 Transport Layer II Data over TCP Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Theophilus Benson.

1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.

27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.

The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.

TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.

1 1 July 28, Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design.

Compound TCP in NS-3 Keith Craig 1. Worcester Polytechnic Institute What is Compound TCP? As internet speeds increased, the long ‘ramp’ time of TCP Reno.

TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.

1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:

Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.

1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.

We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.

The Macroscopic behavior of the TCP Congestion Avoidance Algorithm.

NOSSDAV '97 Understanding TCP Dynamics in an Integrated Services Internet Wu-chang Feng, Dilip Kandlur, Debanjan Saha, and Kang Shin.

© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.

Increasing TCP's CWND based on Throughput draft-you-iccrg-throughput-based-cwnd-increasing-00 Jianjie You IETF92 Dallas.

CS 268: Lecture 5 (TCP Congestion Control) Ion Stoica February 4, 2004.

TCP Vegas Congestion Control Algorithm

CUBIC Marcos Vieira.

TCP Vegas: New Techniques for Congestion Detection and Avoidance

Introduction to Congestion Control

TCP Vegas: New Techniques for Congestion Detection and Avoidance

TCP-LP Distributed Algorithm for Low-Priority Data Transfer

Open Issues in Router Buffer Sizing

TCP Westwood(+) Protocol Implementation in ns-3

AMP: A Better Multipath TCP for Data Center Networks

CS 268: Lecture 4 (TCP Congestion Control)

Project-2 (20%) – DiffServ and TCP Congestion Control

TCP Congestion Control

EE 122: Lecture 10 (Congestion Control)

CSE 4213: Computer Networks II

Review of Internet Protocols Transport Layer

When to use and when not to use BBR:

Presentation transcript:

1 TCP-BFA: Buffer Fill Avoidance September 1998 Amr A. Awadallah Chetan Rai Computer Systems Laboratory Stanford University

2 TCP Congestion Avoidance Offered Load Delay Throughput (Goodput) Disadvantages: 1. High Buffer Occupancies 2. High Delay 3. Periodic Packet Losses 4. Bursty Traffic Pattern Knee Cliff

3 Operate Closer to the Knee Offered Load Delay Throughput Advantages: 1. Smaller Buffers 2. Lower Delay 3. Fewer Packet Losses 4. Faster Loss Detection 5. Smoother Traffic Patterns Knee Cliff

4 How To Estimate ? Signed RTT variance (srv): where = current RTT - smoothed RTT and = filter gain constant Time srv Disable Threshold Enable Threshold Enable BFA Mode Disable BFA Mode

5 Buffer Fill Avoidance A) Incrementing the Congestion Window: if( BFA Flag is set ) hold cwnd else allow normal cwnd increase. B) Setting the Buffer Fill Avoidance Flag: Rule 1: if( BFA Flag is set ) if(Signed_RTT_Variance ) set BFA Flag Rule 2: Clear the BFA Flag whenever the congestion window drops due to loss.

6 Simulation Simulations using the ns network simulator. 64 Kbps, 100 ms 10 Mbps, 10 ms Source 1 Source 2 Sink 1 Sink 2 Node 1 Node 2

Simulation Single Sources Competing Sources Buffer Occupancy (packets) Buffer Size (packets) TCP-BFA Reno Network Power (Throughput/Delay) TCP-BFA Reno Time (sec) Buffer Occupancy (packets) Reno vs. Reno TCP-BFA vs. TCP-BFA Buffer Size (packets) Network Power (Throughput/Delay) Reno1 TCP-BFA 1&2 Reno2 TCP-BFA Reno Time (sec)

8 Simulation - Fairness Buffer Size (packets) Jain’s Fairness Index ( 1 = fair, 0 = unfair) Reno (starting together) Reno (starting at different times) TCP-BFA (starting together) TCP-BFA (starting at different times)

9 Measurements Modified the FreeBSD TCP kernel to perform buffer fill avoidance. Internet (20 hops) SourceSink Stanford, USA 64Kbps 320 ms Cairo, Egypt

Low Congestion TCP-BFATCP-Reno Time (s) Congestion Window (KB) Time (s) Advertised Window Congestion Window (KB) cwnd (KB) RTT (sec) cwnd (KB) RTT (sec)

Medium Congestion TCP-BFATCP-Reno Time (s) cwnd (KB) RTT (sec) Congestion Window (KB) Time (s) Congestion Window (KB) cwnd (KB) RTT (sec)

12 Summary Advantages: –Lower buffer occupancies  Fewer Losses –Lower delays  Faster loss detection –Smoother traffic patterns –Easy to integrate into current implementations Disadvantages: –Slightly lower throughput –Unfairness in ideal situations TCP-BFA: Operate closer to knee than cliff