TCP Westwood with Agile Probing: Handling Dynamic Large Leaky Pipes.

Slides:

Advertisements

Similar presentations

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.

Advertisements

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.

TCP Probe: A TCP with Built-in Path Capacity Estimation Anders Persson, Cesar Marcondes, Ling-Jyh Chen, Li Lao, M. Y. Sanadidi, Mario Gerla Computer Science.

3/2/2001Hanoch Levy, CS, TAU1 TCP Behavior and Performance Workshop on QoS Hanoch Levy April 2004.

1 TCP Congestion Control. 2 TCP Segment Structure source port # dest port # 32 bits application data (variable length) sequence number acknowledgement.

Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.

Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.

TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.

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.

Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.

School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.

TCP in Wireless Ad Hoc Networks

Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.

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

Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.

CS215 TCP Westwood Control Model Development and Stability Analysis Hu, Kunzhong Dong, Haibo Mentor: Wang, Ren Professor:

TCP Westwood (TCPW) and Bandwidth Estimation cs218 – fall 2003 Claudio E. Palazzi tutor: Dr. Giovanni Pau.

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

Comparison between TCPWestwood and eXplicit Control Protocol (XCP) Jinsong Yang Shiva Navab CS218 Project - Fall 2003.

1 TCP Bulk Repeat CS218 Fall 2003 Students: Ricardo Oliveira, Joshua Choi, William So Tutor: Guang Yang 11/24/2003.

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.

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

TCP in Heterogeneous Network Md. Ehtesamul Haque # P.

Adaptive MPEG4 Video Streaming using Bandwidth Estimation Mario Gerla, Alex Balk, Medy Sanadidi {gerla, abalk, Dario Maggiorini

CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)

TCP Westwood: Experiments over Large Pipes Cesar Marcondes Anders Persson Prof. M.Y. Sanadidi Prof. Mario Gerla NRL – Network Research Lab UCLA.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 TCP (Part II) Shivkumar Kalyanaraman Rensselaer Polytechnic Institute

Inline Path Characteristic Estimation to Improve TCP Performance in High Bandwidth-Delay Networks HIDEyuki Shimonishi Takayuki Hama Tutomu Murase Cesar.

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

TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.

Transport Layer 4 2: Transport Layer 4.

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

TCP in Wireless Ad Hoc Networks TCP on Wireless Ad Hoc Networks TCP overview Ad hoc TCP and network layer: mobility, route failures and timeout.

Improving TCP Performance over Mobile Networks Zahra Imanimehr Rahele Salari.

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

TCP CS 168 Discussion Week 6 Many thanks to past EE 122 GSIs.

Transport over Wireless Networks Myungchul Kim

EE 122: Congestion Control and Avoidance Kevin Lai October 23, 2002.

TCP Westwood The work is supported by the 2/032/2004 ELTE-BUTE-Ericsson NKFP project on Research and Developments of Tools Supporting Optimal Usage of.

February 2005Proprietary Content1 The Role of PCE in the Evolution of Transport Protocols Pfldnet 2005, Lyon, France M. Y. “Medy” Sanadidi

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

TCP Westwood: Efficient Transport for High-speed wired/wireless Networks 2009.

What is TCP? Connection-oriented reliable transfer Stream paradigm

Transport Layer 3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March

CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.

Computer Networking Lecture 18 – More TCP & Congestion Control.

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

1 Sonia FahmyPurdue University TCP Congestion Control Sonia Fahmy Department of Computer Sciences Purdue University

CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.

T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides.

Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.

Recap of Lecture 19 If symptoms persist, please consult Dr Jacobson.

TCP Westwood: Efficient Transport for High-speed wired/wireless Networks 2008.

Recap Slow start introduced cwnd Slow start introduced cwnd Can transmit up to Can transmit up to min( cwnd, offered window ) Flow control by the sender.

Congestion Control CS 168 Discussion Week 7. RECAP: How does TCP set rate? How much data can be outstanding? – min{RWND, CWND} RWND: do not overload the.

1 Testing TCP Westwood+ over Transatlantic Links at 10 Gigabit/Second rate Saverio Mascolo Dipartimento di Elettrotecnica ed Elettronica Politecnico di.

@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.

@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.

CS450 – Introduction to Networking Lecture 19 – Congestion Control (2)

Chapter 3 outline 3.1 transport-layer services

COMP 431 Internet Services & Protocols

Mario Gerla, Medy Sanadidi, Ren Wang and Massimo Valla

TCP Westwood(+) Protocol Implementation in ns-3

ECEN “Internet Protocols and Modeling”

CS640: Introduction to Computer Networks

Improving TCP Start-up over High Bandwidth Delay Paths

Transport Layer: Congestion Control

TCP flow and congestion control

TCP: Transmission Control Protocol Part II : Protocol Mechanisms

Presentation transcript:

TCP Westwood with Agile Probing: Handling Dynamic Large Leaky Pipes

Problem Definition Leaky Pipes: packet loss due to error –Unjustified cwnd cut and premature Slow Start exit Large Pipes: Large capacity and long delay –Control scheme may not scale Dynamic Pipes: Dynamic load/changing link bandwidth (Due to change of technologies, e.g., , Bluetooth, 1XRTT) –Linear increase limits efficiency

Key Solution Components Sender-side only enhancement: TCP Westwood Persistent Non-Congestion Detection: –Detect extra unused bandwidth –Invoke Agile Probing Agile Probing: Probe efficiently but not too fast

TCP Westwood (TCPW) Sender Internet Bottleneck packets ACK s measure

TCP Westwood (TCPW) Network viewed as blackbox;Estimation done on sender After dup-acks: –cwnd and ssthresh  ERE * RTTmin After a timeout: –ssthresh  ERE * RTTmin, cwnd  1

Eligible Rate Estimate (ERE) TkTk TkTk ERE Adaptation : ACK k Non-congestion congestion Congestion

Eligible Rate Estimate (ERE) ERE sample:Calculated by bytes delivered in interval T k –Congestion level decided by expected rate and achieved rate –Light Congestion: short Tk,(packet-pair like) –Heavy Congestion: long Tk, (packet-train like) Using discrete low pass filter to get smoothed ERE

Persistent Non-Congestion Detection(PNCD) Objective: Detect unused bandwidth/invoke Agile Probing Observe Achieved Rate (AR) and Expected Rate (ER) PNC, indicating extra unused bandwidth- >Agile Probing invokedIf AR follows ER for a considerably long time -> PNC, indicating extra unused bandwidth- >Agile Probing invoked

Persistent Non-Congestion Detection(PNCD) Persistent Non-congestion detected, Agile Probing invoked Dominant flows leave At around 50 sec

Agile Probing Objective: Guided by ERE, converge faster to more appropriate ssthresh –adaptively and repeatedly resets ssthresh to ERE*RTTmin –Exponentially increase cwnd if ssthresh >cwnd –Linearly increase cwnd if ERE < ssthresh –Exit Agile Probing when packet loss is detected

Agile Probing

Performance Evaluation (1) Throughput vs. bottleneck capacity during first 20 seconds (RTT=100ms)

Performance Evaluation (2) Throughput vs. delay: 100 flows (each last 30sec) randomly spread out during 20 minutes (bottleneck capacity = 45Mbps)

Performance Evaluation (3) Friendliness and convergence