WB-RTO: A Window-Based Retransmission Timeout. Ioannis Psaras, Vassilis Tsaoussidis Demokritos University of Thrace, Xanthi, Greece
|
|
- Gloria Blair
- 5 years ago
- Views:
Transcription
1 WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras, Vassilis Tsaoussidis Demokritos University of Thrace, Xanthi, Greece
2 Motivation and Contribution We observe that retransmission scheduling affects transmission scheduling WB-RTO results in: 50% less retransmitted pkts Higher Goodput, and Better Fairness than TCP-RTO TCP-RTO WB-RTO COMputer NETworks Group (COMNET) 2
3 Motivation-Contribution Perspective: When contention increases, the timeout becomes the scheduler for the link. Motivation: When contention is high, all flows measure similar RTTs. TCP-RTO should not be solely based on RTT measurements. Congestion events cause retransmission synchronization. Algorithm: Approximation of the current level of network contention Estimation of the contribution of each flow to congestion Allowance for asynchronous retransmissions when timeout happens. COMputer NETworks Group (COMNET) 3
4 Motivation Queuing Policy: DropTail DBP = Buffer Size = 10 pkts 5 participating flows 1500 sec total simulation time Flows ideal rate = 2 pkts/wnd We trace: Seqno progress, RTT, RTO Sequence Number Dumbbell Network Topology RTT (in secs) COMputer NETworks Group (COMNET) 4
5 Motivation For the TCP-RTO performance, we observe: RTT stabilization Similar timeout values RTO (in secs) ~3000 retransmitted packets in 1500 seconds Un-Fairness We investigate the impact of retransmission synchronization on system behavior (e.g. overhead) TCP Performance COMputer NETworks Group (COMNET) 5
6 Outline of the presentation The current Retransmission Timeout Algorithm Recent Related Work The proposed algorithm: WB-RTO The algorithm Expected Behavior Evaluation Plan Experimental Results COMputer NETworks Group (COMNET) 6
7 The current Retransmission Timeout Algorithm Upon each ACK arrival, the sender: Calculates the RTT Variation: Updates the expected RTT prior to calculating the timeout: Calculates the Retransmission Timeout value: COMputer NETworks Group (COMNET) 7
8 Recent Related Work Eifel RTO Algorithm Uses the timestamp option to detect a spurious timeout. Forward RTO Algorithm Uses the first 3 ACKs after the timeout to decide if the timeout was spurious or not. Peak-Hopper RTO Algorithm Uses 2 timers: one is aggressive and one is conservative. Each time it decides which one to follow. CA-RTO: A Contention-Adaptive RTO Integrates a contention-adaptive parameter and introduces random retransmission scheduling. COMputer NETworks Group (COMNET) 8
9 The 3 stages of WB-RTO 1. Contribution to Congestion penalty charge 2. Estimation of Contention determine the scale of possible values 3. Calculation of Timeout COMputer NETworks Group (COMNET) 9
10 Window-Based RTO (1/4): Proportional Timeout Estimation of the contribution of the flow to congestion: c = f(cwnd, max cwnd ) Compare the current cwnd_ with the max_cwnd_: If cwnd_ < max_cwnd_ / 2, c = 1: minimal charge If max_cwnd_ / 2 < cwnd_ < (3/4)* max_cwnd_, c = 1,5: medium charge If (3/4)* max_cwnd_ < cwnd_ < max_cwnd_, c = 2: major charge COMputer NETworks Group (COMNET) 10
11 Window-Based RTO (2/4): Contention Estimation Flow classification according to its cwnd_ history (awnd_): ai = g(awnd, Thresholdi) where, awnd=average window, Thresholds 1 to 4 represent different levels of network contention: Threshold 1 corresponds to very high contention Threshold 4 corresponds to low contention Example: 1. awnd_ < 5: a1 = < awnd_ < 10: a2 = < awnd_ < 30: a3 = < awnd_ < 50: a4 = 2 COMputer NETworks Group (COMNET) 11
12 Adjust the scale COMputer NETworks Group (COMNET) 12
13 Window-Based RTO (3/4): Timeout Adjustment Calculation of the Window-Based RTO: or WB RTO = random(rtt, c ai) WB RTO = random(rtt, f(cwnd, max cwnd ) g(awnd, Thresholdi)) 7. rtt, to avoid timeout expiration prior to the estimated RTT measurement 8. Parameter c captures the contribution of the flow to congestion 9. Parameter a approximates the current level of flow contention 10. Randomization guarantees asynchronous retransmission attempts COMputer NETworks Group (COMNET) 13
14 Window-Based RTO (4/4): Expected Behavior High penalties result in high timeout values. As awnd_ increases timeout settles to smaller values. So, Large windows do not always mean large timeout values. WB-RTO vs awnd_ COMputer NETworks Group (COMNET) 14
15 Performance Evaluation Plan WB-RTO is implemented in TCP-Reno Evaluation Scenarios Motivation Part Scenario Scenario 1: Standard/Proposed Parameters Scenario 2: Modified Parameters COMputer NETworks Group (COMNET) 15
16 An Important Note WB-RTO does not improve the Goodput performance of TCP significantly We focus on concurrent Retransmissions hence we pay more attention on the combination of the retransmission effort and the Goodput performance, rather than on the Goodput performance alone. COMputer NETworks Group (COMNET) 16
17 Scenario 1 Queuing Policy: DropTail Bottleneck BW = 10Mbps Bottleneck Delay = 10ms Buffer Size = 50 pkts 1500 sec total simulation time Goodput (in B/s) Retransmitted Packets COMputer NETworks Group (COMNET) 17
18 Scenario 1 Contention grows->wb-rto allows for better multiplexing Behavior Captured by fairness index More flows are getting service Fairness Goodput per Flow (B/s) COMputer NETworks Group (COMNET) 18
19 Scenario 2 Queuing Policy: DropTail Bottleneck BW = 10Mbps Bottleneck Delay = 10ms Buffer Size = 50 pkts 1500 sec total simulation time Scale now different Goodput (in B/s) Retransmitted Packets COMputer NETworks Group (COMNET) 19
20 Scenario 2 Fairness initially drops when the scale is not adjusted appropriately Fairness Goodput per Flow (B/s) COMputer NETworks Group (COMNET) 20
21 Interaction with AQM (i.e. RED) (1) Topology: Dumbbell Queuing Policy: RED DBP = Buffer Size = 40 pkts min_thresh = 4 pkts max_thresh = 12 pkts 1500 sec total simulation time Goodput (in B/s) Number of Timeouts Retransmitted Packets COMputer NETworks Group (COMNET) 21
22 Interaction with AQM (i.e. RED) (2) We observe: Similar Goodput Significant difference in Retransmission Effort (50%) WB-RTO results in 66% less timeout expirations TCP-RTO causes inefficient queue utilization The average queue length always overcomes the max_thresh, when using TCP- RTO TCP-RTO WB-RTO COMputer NETworks Group (COMNET) 22
23 Satellite Scenario (1) Topology: Cross-Traffic Bottleneck Queuing Policy: RED The rest of the buffers use DT bw_bottleneck = 20Mbps bw_delay = 300ms Buffer Size = 200 pkts min_thresh = 20 pkts max_thresh = 60 pkts 150 sec total simulation time PER = 0,0001 No blackout 3 blackouts on the backbone link After 3 blackouts COMputer NETworks Group (COMNET) 23
24 Satellite Scenario (2) We observe that: TCP-RTO interprets the blackout as a congestion signal WB-RTO does not extend the timeout, due to low contention and hence exploits bandwidth faster TCP still waits for the extended timeout to expire, while WB-RTO resumes transmission immediately TCP-RTO WB-RTO COMputer NETworks Group (COMNET) 24
25 Traffic Diversity (Mice and Elephants) (1) Topology: Dumbbell Bottleneck Queuing Policy: RED bw_bottleneck = 10Mbps bw_delay = 30ms Buffer Size = 40 pkts Goodput (KB/s) Goodput per flow (KB/s) Retransmitted Packets COMputer NETworks Group (COMNET) 25
26 Traffic Diversity (Mice and Elephants) (2) We observe: Simultaneous timeout events for TCP-RTO All flows timeout during the Slow-Start Flows 7-9 timeout simultaneously 10 times during the experiment Short flows: 83 vs 50 timeouts Long flows: 43 vs 12 timeouts We conclude that: most of the timeouts are spurious WB-RTO achieves an important goal: it reduces the number of timeouts TCP-RTO WB-RTO COMputer NETworks Group (COMNET) 26
27 Conclusions RTT measurements cannot always reflect the level of network contention TCP-RTO should not be solely based on RTT samples A contention-aware RTO proves to be more efficient, since it is aware of current network conditions. A randomization factor in the RTO schedules retransmissions in a fairer manner WB-RTO cancels some of TCP miss-responses with noncongestion errors COMputer NETworks Group (COMNET) 27
28 Other References [1] CA-RTO: A Contention-Adaptive Retransmission Timeout for TCP, Ioannis Psaras, Vassilis Tsaoussidis, IEEE ICCCN 05 [2] Why TCP Timers (still) Don t Work Well, Ioannis Psaras, Vassilis Tsaoussidis, Computer Networks (COMNET), Elsevier Science, to appear COMputer NETworks Group (COMNET) 28
WB-RTO: A Window-Based Retransmission Timeout for TCP
WB-RTO: A Window-Based Retransmission Timeout for TCP Ioannis Psaras and Vassilis Tsaoussidis Dept. of Electrical and Computer Engineering Demokritos University of Thrace Xanthi, Greece Email: {ipsaras,
More informationThe TCP Minimum RTO Revisited
The TCP Minimum RTO Revisited Ioannis Psaras and Vassilis Tsaoussidis (ipsaras, vtsaousi)@ee.duth.gr COMputer NETworks (COMNET) Group Democritus University of Thrace, Xanthi, Greece http://comnet.ee.duth.gr/
More informationThe War Between Mice and Elephants
The War Between Mice and Elephants (by Liang Guo and Ibrahim Matta) Treating Short Connections fairly against Long Connections when they compete for Bandwidth. Advanced Computer Networks CS577 Fall 2013
More informationOn the Properties of an Adaptive
On the Properties of an Adaptive TCP Minimum RTO Ioannis Psaras, Vassilis Tsaoussidis Democritus University of Thrace Dept. of Electrical and Computer Engineering 12 Vas. Sofias Str., 67100 Xanthi, Greece
More informationPerformance Analysis of TCP Variants
102 Performance Analysis of TCP Variants Abhishek Sawarkar Northeastern University, MA 02115 Himanshu Saraswat PES MCOE,Pune-411005 Abstract The widely used TCP protocol was developed to provide reliable
More informationOutline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste
Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,
More informationHybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks
Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate
More informationThe War Between Mice and Elephants
The War Between Mice and Elephants Liang Guo and Ibrahim Matta Computer Science Department Boston University 9th IEEE International Conference on Network Protocols (ICNP),, Riverside, CA, November 2001.
More informationImproving Internet Performance through Traffic Managers
Improving Internet Performance through Traffic Managers Ibrahim Matta Computer Science Department Boston University Computer Science A Glimpse of Current Internet b b b b Alice c TCP b (Transmission Control
More informationA Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks. Motivation
A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks Stephan Bohacek João P. Hespanha Junsoo Lee Katia Obraczka University of Delaware University of Calif.
More informationShaping TCP Traffic in Heterogeneous Networks
Shaping TCP Traffic in Heterogeneous Networks I. Psarras, L. Mamatas and V.Tsaoussidis Dept. of Electrical and Computer Engineering Demokritos University of Thrace, Greece {ipsaras, emamatas, vtsaousi}@ee.duth.gr
More informationWhy Rely on Blind AIMDs?
Why Rely on Blind AIMDs? (Work in Progress) Ioannis Psaras, Mehrdad Dianati, and Rahim Tafazolli Center for Communication Systems Research (CCSR) Dept. of El. Eng., University of Surrey Guildford, GU2
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet
More informationReasons not to Parallelize TCP Connections for Fast Long-Distance Networks
Reasons not to Parallelize TCP Connections for Fast Long-Distance Networks Zongsheng Zhang Go Hasegawa Masayuki Murata Osaka University Contents Introduction Analysis of parallel TCP mechanism Numerical
More informationExercises TCP/IP Networking With Solutions
Exercises TCP/IP Networking With Solutions Jean-Yves Le Boudec Fall 2009 3 Module 3: Congestion Control Exercise 3.2 1. Assume that a TCP sender, called S, does not implement fast retransmit, but does
More informationComputer Networking Introduction
Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.11 Chapter 3 outline 3.1 transport-layer services 3.2 multiplexing and
More informationThe Impact of Delay Variations on TCP Performance
INSTITUT FÜR KOMMUNIKATIONSNETZE UND RECHNERSYSTEME Prof. Dr.-Ing. Dr. h. c. mult. P. J. Kühn The Impact of Delay Variations on TCP Performance Michael Scharf scharf@ikr.uni-stuttgart.de ITG FG 5.2.1 Workshop,
More informationBandwidth Allocation & TCP
Bandwidth Allocation & TCP The Transport Layer Focus Application Presentation How do we share bandwidth? Session Topics Transport Network Congestion control & fairness Data Link TCP Additive Increase/Multiplicative
More informationOverview. TCP congestion control Computer Networking. TCP modern loss recovery. TCP modeling. TCP Congestion Control AIMD
Overview 15-441 Computer Networking Lecture 9 More TCP & Congestion Control TCP congestion control TCP modern loss recovery TCP modeling Lecture 9: 09-25-2002 2 TCP Congestion Control Changes to TCP motivated
More informationCS644 Advanced Networks
What we know so far CS644 Advanced Networks Lecture 6 Beyond TCP Congestion Control Andreas Terzis TCP Congestion control based on AIMD window adjustment [Jac88] Saved Internet from congestion collapse
More informationInternet Networking recitation #10 TCP New Reno Vs. Reno
recitation #0 TCP New Reno Vs. Reno Spring Semester 200, Dept. of Computer Science, Technion 2 Introduction Packet Loss Management TCP Reno (RFC 258) can manage a loss of at most one packet from a single
More informationDS-TP: Deep-Space Transport Protocol
DS-TP: Deep-Space Transport Protocol I. Psaras, G. Papastergiou & V. Tsaoussidis Democritus University of Thrace, Xanthi, Greece Computer Networks Laboratory comnet.ee.duth.gr/comnet (ipsaras, gpapaste,
More informationCongestion. Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets limited resources
Congestion Source 1 Source 2 10-Mbps Ethernet 100-Mbps FDDI Router 1.5-Mbps T1 link Destination Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets
More information8. TCP Congestion Control
8. TCP Congestion Control 1 TCP Congestion Control Slow-start increase Multiplicative decrease Congestion avoidance Measurement of variation Exponential timer backoff 2002 Yanghee Choi 2 Congestion Control
More informationFall 2012: FCM 708 Bridge Foundation I
Fall 2012: FCM 708 Bridge Foundation I Prof. Shamik Sengupta Instructor s Website: http://jjcweb.jjay.cuny.edu/ssengupta/ Blackboard Website: https://bbhosted.cuny.edu/ Intro to Computer Networking Transport
More informationDualRTT: Enhancing TCP Performance During Delay Spikes
DualRTT: Enhancing TCP Performance During Delay Spikes Ph.D. School of Computer Science University of Oklahoma. Email: atiq@ieee.org Web: www.cs.ou.edu/~atiq Presentation at Tohoku University, Sendai,
More informationCloud e Datacenter Networking
Cloud e Datacenter Networking Università degli Studi di Napoli Federico II Dipartimento di Ingegneria Elettrica e delle Tecnologie dell Informazione DIETI Laurea Magistrale in Ingegneria Informatica Prof.
More informationTCP Congestion Control
6.033, Spring 2014 TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina Sharing the Internet How do you manage resources in a huge system like the Internet, where users with different
More informationReliable Transport II: TCP and Congestion Control
Reliable Transport II: TCP and Congestion Control Stefano Vissicchio UCL Computer Science COMP0023 Recap: Last Lecture Transport Concepts Layering context Transport goals Transport mechanisms and design
More informationWhat is Congestion? Congestion: Moral of the Story. TCP Approach. Transport Layer: TCP Congestion Control & Buffer Management
Transport Layer: TCP Congestion Control & Buffer Management Congestion Control What is congestion? Impact of Congestion Approaches to congestion control TCP Congestion Control End-to-end based: implicit
More informationPrinciples of congestion control
Principles of congestion control Congestion: Informally: too many sources sending too much data too fast for network to handle Different from flow control! Manifestations: Lost packets (buffer overflow
More informationTCP so far Computer Networking Outline. How Was TCP Able to Evolve
TCP so far 15-441 15-441 Computer Networking 15-641 Lecture 14: TCP Performance & Future Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 Reliable byte stream protocol Connection establishments
More informationWireless TCP Performance Issues
Wireless TCP Performance Issues Issues, transport layer protocols Set up and maintain end-to-end connections Reliable end-to-end delivery of data Flow control Congestion control Udp? Assume TCP for the
More informationTCP Enhancements in Linux. Pasi Sarolahti. Berkeley Summer School Outline
TCP Enhancements in Linux Pasi Sarolahti Berkeley Summer School 6.6.2002 Outline TCP details per IETF RFC s Pitfalls in the specifications Linux TCP congestion control engine Features Discussion on performance
More informationImpact of transmission errors on TCP performance. Outline. Random Errors
Impact of transmission errors on TCP performance 1 Outline Impact of transmission errors on TCP performance Approaches to improve TCP performance Classification Discussion of selected approaches 2 Random
More informationADVANCED TOPICS FOR CONGESTION CONTROL
ADVANCED TOPICS FOR CONGESTION CONTROL Congestion Control The Internet only functions because TCP s congestion control does an effective job of matching traffic demand to available capacity. TCP s Window
More informationChapter 3 Transport Layer
Chapter 3 Transport Layer 1 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles of reliable data transfer 3.5 Connection-oriented
More informationImproving the Robustness of TCP to Non-Congestion Events
Improving the Robustness of TCP to Non-Congestion Events Presented by : Sally Floyd floyd@acm.org For the Authors: Sumitha Bhandarkar A. L. Narasimha Reddy {sumitha,reddy}@ee.tamu.edu Problem Statement
More informationEXPERIENCES EVALUATING DCTCP. Lawrence Brakmo, Boris Burkov, Greg Leclercq and Murat Mugan Facebook
EXPERIENCES EVALUATING DCTCP Lawrence Brakmo, Boris Burkov, Greg Leclercq and Murat Mugan Facebook INTRODUCTION Standard TCP congestion control, which only reacts to packet losses has many problems Can
More informationCSCI Topics: Internet Programming Fall 2008
CSCI 491-01 Topics: Internet Programming Fall 2008 Transport Layer Derek Leonard Hendrix College October 20, 2008 Original slides copyright 1996-2007 J.F Kurose and K.W. Ross 1 Chapter 3: Roadmap 3.1 Transport-layer
More informationChapter III: Transport Layer
Chapter III: Transport Layer UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross Principles of congestion control
More informationLecture 15: Transport Layer Congestion Control
Lecture 15: Transport Layer Congestion Control COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationChapter 3 Transport Layer
Chapter 3 Transport Layer Part c Congestion Control Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Transport Layer 3-1 Chapter 3 outline 3.1 transport-layer
More informationcs/ee 143 Communication Networks
cs/ee 143 Communication Networks Chapter 4 Transport Text: Walrand & Parakh, 2010 Steven Low CMS, EE, Caltech Recap: Internet overview Some basic mechanisms n Packet switching n Addressing n Routing o
More informationfile:///c:/users/hpguo/dropbox/website/teaching/fall 2017/CS4470/H...
1 of 9 11/26/2017, 11:28 AM Homework 3 solutions 1. A window holds bytes 2001 to 5000. The next byte to be sent is 3001. Draw a figure to show the situation of the window after the following two events:
More informationComputer Networks. Course Reference Model. Topic. Congestion What s the hold up? Nature of Congestion. Nature of Congestion 1/5/2015.
Course Reference Model Computer Networks 7 Application Provides functions needed by users Zhang, Xinyu Fall 204 4 Transport Provides end-to-end delivery 3 Network Sends packets over multiple links School
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More information15-744: Computer Networking TCP
15-744: Computer Networking TCP Congestion Control Congestion Control Assigned Reading [Jacobson and Karels] Congestion Avoidance and Control [TFRC] Equation-Based Congestion Control for Unicast Applications
More informationCongestion control in TCP
Congestion control in TCP If the transport entities on many machines send too many packets into the network too quickly, the network will become congested, with performance degraded as packets are delayed
More informationCS321: Computer Networks Congestion Control in TCP
CS321: Computer Networks Congestion Control in TCP Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Causes and Cost of Congestion Scenario-1: Two Senders, a
More informationOverview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers
Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control
More informationCongestion Avoidance
COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Congestion Avoidance Jasleen Kaur Fall 2016 1 Avoiding Congestion: Strategies TCP s strategy: congestion control Ø Control congestion once it occurs Repeatedly
More informationCS268: Beyond TCP Congestion Control
TCP Problems CS68: Beyond TCP Congestion Control Ion Stoica February 9, 004 When TCP congestion control was originally designed in 1988: - Key applications: FTP, E-mail - Maximum link bandwidth: 10Mb/s
More informationCSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca
CSCI-1680 Transport Layer III Congestion Control Strikes Back Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti, Ion Stoica Last Time Flow Control Congestion Control
More informationReliable Transport II: TCP and Congestion Control
Reliable Transport II: TCP and Congestion Control Brad Karp UCL Computer Science CS 3035/GZ01 31 st October 2013 Outline Slow Start AIMD Congestion control Throughput, loss, and RTT equation Connection
More informationConsidering Spurious Timeout in Proxy for Improving TCP Performance in Wireless Networks
Considering Spurious Timeout in Proxy for Improving TCP Performance in Wireless Networks YuChul Kim Telecommunication R&D Center, Samsung Electronics,Co., Ltd yuchul.kim@samsung.com DongHo Cho Communication
More informationTCP Congestion Control 65KB W
TCP Congestion Control 65KB W TO 3DA 3DA TO 0.5 0.5 0.5 0.5 3 3 1 SS SS CA SS CA TCP s Congestion Window Maintenance TCP maintains a congestion window (cwnd), based on packets Sender s window is limited
More informationIJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online):
IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online): 2321-0613 Performance Evaluation of TCP in the Presence of in Heterogeneous Networks by using Network
More informationAIRA: Additive Increase Rate Accelerator
AIRA: Additive Increase Rate Accelerator Ioannis Psaras and Vassilis Tsaoussidis Dept. of Electrical and Computer Engineering Democritus University of Thrace, 12 Vas. Sofias Str., 67100, Xanthi, Greece
More informationImplementing TCP SACK Conservative Loss Recovery Algorithm within a NDN Consumer
Implementing TCP SACK Conservative Loss Recovery Algorithm within a NDN Consumer Shuo Yang 1. Design Consumer uses packet timeout as signal of congestion; Consumer reacts to one packet loss event per RTT
More informationCongestion Control for High Bandwidth-delay Product Networks
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Chi-Yao Hong Adapted from slides by Dina Katabi CS598pbg Sep. 10, 2009 Trends in the Future
More informationCS Transport. Outline. Window Flow Control. Window Flow Control
CS 54 Outline indow Flow Control (Very brief) Review of TCP TCP throughput modeling TCP variants/enhancements Transport Dr. Chan Mun Choon School of Computing, National University of Singapore Oct 6, 005
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationTimestamp Retransmission Algorithm for TCP-Cherry over InterPlaNetary Internet
Network and Communication Technologies; Vol. 1, No. 2; 2012 ISSN 1927-064X E-ISSN 1927-0658 Published by Canadian Center of Science and Education Timestamp Retransmission Algorithm for TCP-Cherry over
More informationCSC 4900 Computer Networks: TCP
CSC 4900 Computer Networks: TCP Professor Henry Carter Fall 2017 Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles of reliable
More informationPerformance Comparison of TFRC and TCP
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS FINAL PROJECT Performance Comparison of TFRC and TCP Spring 2002 Yi Zheng and Jian Wen {zyi,jwena}@cs.sfu.ca
More informationCS 349/449 Internet Protocols Final Exam Winter /15/2003. Name: Course:
CS 349/449 Internet Protocols Final Exam Winter 2003 12/15/2003 Name: Course: Instructions: 1. You have 2 hours to finish 2. Question 9 is only for 449 students 3. Closed books, closed notes. Write all
More informationCongestion Control in Communication Networks
Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below
More informationCongestion Control. Tom Anderson
Congestion Control Tom Anderson Bandwidth Allocation How do we efficiently share network resources among billions of hosts? Congestion control Sending too fast causes packet loss inside network -> retransmissions
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle Dissertation Defense May 14, 2003 Advisor: Kevin Jeffay Research Question Can the use of exact timing information improve
More informationCongestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Outline Introduction What s wrong with TCP? Idea of Efficiency vs. Fairness XCP, what is it? Is it
More informationTCP s Retransmission Timer and the Minimum RTO
TCP s Retransmission Timer and the Minimum RTO Alae Loukili, Alexander L. Wijesinha, Ramesh K. Karne, and Anthony K. Tsetse Department of Computer & Information Sciences Towson University Towson, MD 2122,
More informationTCP. CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli)
TCP CSU CS557, Spring 2018 Instructor: Lorenzo De Carli (Slides by Christos Papadopoulos, remixed by Lorenzo De Carli) 1 Sources Fall and Stevens, TCP/IP Illustrated Vol. 1, 2nd edition Congestion Avoidance
More informationContents. CIS 632 / EEC 687 Mobile Computing. TCP in Fixed Networks. Prof. Chansu Yu
CIS 632 / EEC 687 Mobile Computing TCP in Fixed Networks Prof. Chansu Yu Contents Physical layer issues Communication frequency Signal propagation Modulation and Demodulation Channel access issues Multiple
More informationCongestion Control End Hosts. CSE 561 Lecture 7, Spring David Wetherall. How fast should the sender transmit data?
Congestion Control End Hosts CSE 51 Lecture 7, Spring. David Wetherall Today s question How fast should the sender transmit data? Not tooslow Not toofast Just right Should not be faster than the receiver
More informationATL : An Adaptive Transport Layer Protocol Suite for Next Generation Wireless Internet
ATL : An Adaptive Transport Layer Protocol Suite for Next Generation Wireless Internet O. B. Akan and F. Akyildiz IEEE Trans. On Selected Areas in Communications, vol. 22, no. 5, 2004 First paper deals
More informationCongestion Control Without a Startup Phase
Congestion Control Without a Startup Phase Dan Liu 1, Mark Allman 2, Shudong Jin 1, Limin Wang 3 1. Case Western Reserve University, 2. International Computer Science Institute, 3. Bell Labs PFLDnet 2007
More informationTransport layer issues
Transport layer issues Dmitrij Lagutin, dlagutin@cc.hut.fi T-79.5401 Special Course in Mobility Management: Ad hoc networks, 28.3.2007 Contents Issues in designing a transport layer protocol for ad hoc
More informationTCP congestion control:
TCP congestion control: Probing for usable bandwidth: Ideally: transmit as fast as possible (cwnd as large as possible) without loss Increase cwnd until loss (congestion) Loss: decrease cwnd, then begin
More informationOne More Bit Is Enough
One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM 05, Philadelphia, PA 08 / 23 / 2005 Motivation #1: TCP doesn t work well in high b/w or delay
More informationCongestion Control. Queuing Discipline Reacting to Congestion Avoiding Congestion. Issues
Congestion Control Outline Queuing Discipline Reacting to Congestion Avoiding Congestion Issues Two sides of the same coin pre-allocate resources to avoid congestion (e.g. telephone networks) control congestion
More informationFlow and Congestion Control Marcos Vieira
Flow and Congestion Control 2014 Marcos Vieira Flow Control Part of TCP specification (even before 1988) Goal: not send more data than the receiver can handle Sliding window protocol Receiver uses window
More informationCSE 573S Protocols for Computer Networks (Spring 2005 Final Project)
CSE 573S Protocols for Computer Networks (Spring 2005 Final Project) To Investigate the degree of congestion control synchronization of window-based connections bottlenecked at the same link Kumar, Vikram
More informationCongestion Avoidance and Control. Rohan Tabish and Zane Ma
Congestion Avoidance and Control Rohan Tabish and Zane Ma TCP is self-clocking Self-clocking systems should be robust Congestion collapse Internet had first of what became a series of congestion collapses
More informationTCP Congestion Control
TCP Congestion Control What is Congestion The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting
More informationTCP Congestion Control
What is Congestion TCP Congestion Control The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting
More informationLecture 5: Flow Control. CSE 123: Computer Networks Alex C. Snoeren
Lecture 5: Flow Control CSE 123: Computer Networks Alex C. Snoeren Pipelined Transmission Sender Receiver Sender Receiver Ignored! Keep multiple packets in flight Allows sender to make efficient use of
More informationCSE 461. TCP and network congestion
CSE 461 TCP and network congestion This Lecture Focus How should senders pace themselves to avoid stressing the network? Topics Application Presentation Session Transport Network congestion collapse Data
More informationIIP Wireless. Presentation Outline
IIP Wireless Improving Internet Protocols for Wireless Links Markku Kojo Department of Computer Science www.cs cs.helsinki.fi/research/.fi/research/iwtcp/ 1 Presentation Outline Project Project Summary
More informationChapter 3 outline. 3.5 Connection-oriented transport: TCP. 3.6 Principles of congestion control 3.7 TCP congestion control
Chapter 3 outline 3.1 Transport-layer services 3.2 Multiplexing and demultiplexing 3.3 Connectionless transport: UDP 3.4 Principles of reliable data transfer 3.5 Connection-oriented transport: TCP segment
More informationF-RTO: An Enhanced Recovery Algorithm for TCP Retransmission Timeouts
F-RTO: An Enhanced Recovery Algorithm for TCP Retransmission Timeouts Pasi Sarolahti Nokia Research Center pasi.sarolahti@nokia.com Markku Kojo, Kimmo Raatikainen University of Helsinki Department of Computer
More informationCS Networks and Distributed Systems. Lecture 10: Congestion Control
CS 3700 Networks and Distributed Systems Lecture 10: Congestion Control Revised 2/9/2014 Transport Layer 2 Application Presentation Session Transport Network Data Link Physical Function:! Demultiplexing
More informationLecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren
Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than
More informationCSE/EE 461. TCP congestion control. Last Lecture. This Lecture. Focus How should senders pace themselves to avoid stressing the network?
CSE/EE 461 TCP congestion control Last Lecture Focus How should senders pace themselves to avoid stressing the network? Topics congestion collapse congestion control Application Presentation Session Transport
More informationimage 3.8 KB Figure 1.6: Example Web Page
image. KB image 1 KB Figure 1.: Example Web Page and is buffered at a router, it must wait for all previously queued packets to be transmitted first. The longer the queue (i.e., the more packets in the
More informationCommunication Networks
Communication Networks Spring 2018 Laurent Vanbever nsg.ee.ethz.ch ETH Zürich (D-ITET) April 30 2018 Materials inspired from Scott Shenker & Jennifer Rexford Last week on Communication Networks We started
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks George Porter Thanks: Amin Vahdat, Dina Katabi and Alex C. Snoeren Lecture 14 Overview" TCP congestion control review Dukkipati
More informationUnderstanding TCP Parallelization. Qiang Fu. TCP Performance Issues TCP Enhancements TCP Parallelization (research areas of interest)
Understanding TCP Parallelization Qiang Fu qfu@swin.edu.au Outline TCP Performance Issues TCP Enhancements TCP Parallelization (research areas of interest) Related Approaches TCP Parallelization vs. Single
More informationComputer Networking
15-441 Computer Networking Lecture 17 TCP Performance & Future Eric Anderson Fall 2013 www.cs.cmu.edu/~prs/15-441-f13 Outline TCP modeling TCP details 2 TCP Performance Can TCP saturate a link? Congestion
More information