Studying Fairness of TCP Variants and UDP Traffic
|
|
- Ronald Barnett
- 5 years ago
- Views:
Transcription
1 Studying Fairness of TCP Variants and UDP Traffic Election Reddy B.Krishna Chaitanya Problem Definition: To study the fairness of TCP variants and UDP, when sharing a common link. To do so we conduct various experiments with different scenarios where in we measure parameters like throughput, congestion window (CWND) and round trip time (RTT) delay. Setups, Parameters, Evaluation and Results: We have conducted experiments with three different scenarios. We have tested each scenario with different setups to observe the fairness/unfairness of TCP Tahoe, TCP Reno, TCP NewReno, TCP Sack and UDP. The parameters taken into account are throughput, congestion window and roundtrip time. Scenario1: S D1 shared (router)r1 # # R2 (router) link S D2 The scenario is run with different setups each with different combinations of TCP variant and UDP flows. Some of the experiments and their results are shown below: Case 1: The parameters for this case are: Link Bandwidth Delay s1 r1 2Mbps 10ms s2 r1 2Mbps 10ms r1 r2 1Mbps 20ms d1 r2 2Mbps 10ms d2 r2 2Mbps 10ms The queue limit for the link r1 r2 is 10 packets.
2 For the above parameters, we conducted the following experiments and plotted graphs for throughput, congestion window and round trip time (RTT). 1. S1 D1 flow as a Tahoe flow and S2 D2 flow as a UDP flow Observations: The UDP flow completely dominated the Tahoe flow. The throughput of the Tahoe flow is decreased rapidly as the UDP flow started. As UDP flow started, packets started dropping at the queue, timeout occured at sender S1 and finally the congestion window is brought down to 1. The round trip time graph is constantly increasing as there is lot of congestion at the intermediate routers R1 and R2. 2. S1 D1 flow as a Reno flow and S2 D2 flow as a UDP flow. Observations: The throughput in this case is similar to that of Tahoe UDP case. The congestion window in this case recoverd from the timeout faster than Tahoe as Reno has Fast recovery mechanism. The RTT in this case is better than that of Tahoe case. 3. S1 D1 flow as a NewReno flow and S2 D2 flow as a UDP flow. Observations: The throughput and average congestion window size of NewReno are more than that of Reno and Tahoe. The RTT graph in this case is similar to that of Reno. 4. S1 D1 flow as a SACK flow and S2 D2 flow as a UDP flow. Observations: SACK throughput graph is similar to that of Tahoe, it is less than that of NewReno. Congestion window graph is similar to that of NewReno. Roundtriptime on this case is more than that of NewReno. So NewReno performance is better than all other TCP varients when they run in conjunction with UDP. 5. S1 D1 flow as a Tahoe flow and S2 D2 flow as a Reno flow. Observations: As expected, Reno performs better than Tahoe. The throughput, congestion window and RTT in case of reno are better than that of Tahoe. These can be observed clearly from the graphs.
3 6. S1 D1 flow as a Reno flow and S2 D2 flow as a NewReno flow. Observations: The throughput, congestion window and RTT graphs for both Reno and NewReno are almost similar except that NewReno performed well in throughput and congestion window. 7. S1 D1 flow as a Tahoe flow and S2 D2 flow as a SACK flow. Observations: We observed that SACK performed well in throughput, congestion and RTT graphs. To observe more difference we plotted graphs in this case for a queue size of 5 packets at Router2. Graph for throughput for this case is shown below: In the above graph, the green colored line indicates throughput for SACK and the red colored line indicates throughput for Tahoe.
4 Case 2: The parameters for this case are: Link Bandwidth Delay s1 r1 2Mbps 10ms s2 r1 2Mbps 10ms r1 r2 2Mbps 10ms d1 r2 2Mbps 10ms d2 r2 2Mbps 10ms The queue limit for the link r1 r2 is 20 packets. For the above parameters, we conducted the following experiments and plotted graphs for throughput, congestion window and round trip time (RTT). 1. S1 D1 flow as a Tahoe flow and S2 D2 flow as a UDP flow 2. S1 D1 flow as a Reno flow and S2 D2 flow as a UDP flow. 3. S1 D1 flow as a NewReno flow and S2 D2 flow as a UDP flow. 4. S1 D1 flow as a SACK flow and S2 D2 flow as a UDP flow. Observations: Here we increased the queue size to 20 packets at router 2. So the packet drop decreased and hence throughput for all the TCP variants increased when compared to that of queue size 10. An increase in average CWND is also observed. Even the RTT delay in the case with higher queue size is low when compared to RTT delay in the case with lower queue size. 5. S1 D1 flow as a Tahoe flow and S2 D2 flow as a Reno flow. 6. S1 D1 flow as a Reno flow and S2 D2 flow as a NewReno flow. 7. S1 D1 flow as a Tahoe flow and S2 D2 flow as a SACK flow. Observations: In case of Reno and Tahoe, Reno performed well with respect to all characteristics. Throughput, average CWND and average RTT in case of Reno are better than those of Tahoe. The results for Reno and NewReno experiment are almost similar for all the three characteristics. In case of SACK vs Tahoe, SACK performed well. A sample
5 graph for SACK Tahoe CWND experiment is shown below. This shows the clear difference between the two variants. In the above graph green colored line shows the CWND for SACK and red colored line shows CWND for Tahoe. It can be clearly observed that average CWND for SACK is greater than that of Tahoe. Case 3: The parameters for this case are: Link Bandwidth Delay s1 r1 2Mbps 10ms s2 r1 2Mbps 10ms r1 r2 2Mbps 10ms d1 r2 2Mbps 10ms d2 r2 2Mbps 10ms The queue limit for the link r1 r2 is 30 packets. For the above parameters, we conducted the following experiments and plotted graphs for throughput, congestion window and round trip time (RTT).
6 1. S1 D1 flow as a Tahoe flow and S2 D2 flow as a Reno flow. 2. S1 D1 flow as a Reno flow and S2 D2 flow as a NewReno flow. 3. S1 D1 flow as a Tahoe flow and S2 D2 flow as a SACK flow. Observations : The throughput, average CWND and average RTT delay for all the above cases are observed to be similar. As queue size is increased to 30 packets at the routers, no packet drop is observed and hence all the TCP variants behaved similarly. The graph for RTT SACK and Tahoe in this case is shown below: Effect of Random Early Detection(RED) : All the above experiments are performed using DropTail Queue mechanism. We observed that no considerable amount of increase is found in throughput or CWND by using RED mechanism over Drop Tail method. The reason for this behaviour could be that RED does congestion avoidance so as to avoid congestion in the network. So due to this it might drop many packets and thus reduces the overall throughput and CWND.
7 Scenario 2: S1 D1 \ / \ / S-Sender D R R S2 D-Destination / \ R-Router / \ D3 S3 The main aim of this scenario is to observe whether the reverse traffic has severe effect on the acknowledgements of a the current flow. S1 D1 is considered to be our current flow and reverse traffic is due to the flows S2 D2 and S3 D3. The parameters for this experiment are: Link Bandwidth Delay s1 r1 2Mbps 10ms s2 r2 2Mbps 10ms s3 r2 2Mbps 10ms r1 r2 1Mbps 20ms d1 r2 2Mbps 10ms d2 r1 2Mbps 10ms d3 r1 2Mbps 10ms The queue limit for the links r1 r2 and r2 r1is 10 packets each. Observations: The effect of reverse traffic on S1 D1 flow is that few acknowledgements of this flow are lost at router R2 leading to timeouts for some packets. So throughput of the flow S1 D1 is decreased. But the throughput of the flow S3 D3 is much less than that of the flow S1 D1. This is due to loss of packets at router R2 and also due to sharing of bottleneck link with the flow S2 D2.
8 Scenario 3: S1 S2 S3 S4 S5 S - SENDERS D - DESTINATION R - ROUTERS R1 R2 R3 R4 R5 D The parameters for this case are Link Bandwidth Delay s1 r1 2Mbps 10ms s2 r1 2Mbps 10ms s3 r3 2Mbps 10ms s4 r4 2Mbps 10ms s5 r5 2Mbps 10ms r1 r2 1Mbps 20ms r2 r3 1Mbps 20ms r3 r4 1Mbps 20ms r4 r5 1Mbps 20ms r5 d 2Mbps 10ms The queue sizes at the links are : s1 r1 >10 s2 r2 >10 s3 r3 >10
9 s4 r4 >10 s5 r5 >10 r1 r2 >20 r2 r3 >20 r3 r4 >20 r4 r5 >20 r5 d >10 1. Same TCP variant for all flows. a) All flows are of type Tahoe b) All flows are of type Reno c) All flows are of type NewReno d) All flows are of type SACK Observations : In all the above cases, the throughput for S5 flow is better than all other flows. As packets from all other sources have to pass through more than one bottleneck links, the throughput for those flows is less when compared to that with S5. Similarly the RTT delay for packets that belong to S5 is less than that of all other sources. So the flows which need to cross less number of bottleneck links will perform better. A sample graph for this experiment is shown below. All the flows here are of NewReno type.
10 2. all flows are of different type. a) UDP is nearest and Tahoe is farter from destination s1 d > Tahoe s2 d > Reno s3 d > NewReno s4 d > SACK s5 d > UDP
11 b) UDP is farthest and Tahoe is nearer to destination s1 d > UDP s2 d > SACK s3 d > NewReno s4 d > Reno s5 d > Tahoe Observations : In case (a), throughput and CWND for all the flows decrease as we move farther from the destination, irrespictive of the type of TCP variant used. But in case (b) though SACK is placed farther from destination, it performed well when compared to Reno and NewReno as shown in below graph. In the below shown graph, the red,green, violet, pink,blue colored lines show throughput for UDP, SACK, NewReno, Reno and Tahoe respectively.
12 Conclusion: Thus we can conclude the following about the TCP variants and UDP from our experiments. SACK performs well when compared to all other TCP variants. It is also oberved that SACK performs well even when it is at more distance(more number of bottleneck links and queues in the path) from the destination when compared to other TCP variants which are very near (less number of bottleneck links and queues in the path) to the destination. Performance of TCP Reno and TCP NewReno is similar to a large extent but less than that of SACK and better than that of TCP Tahoe. TCP Tahoe is performing worse when compared to all other TCP variants. UDP traffic when present is occupying the link to the large extent and thus leading to poor performance of any other TCP variant. Reverse Traffic is having a small impact on the TCP traffic. The acknowledgements of the TCP flow are lost due to heavy reverse traffic and hence reduction in performance. Both RED and Drop Tail queuing mechanisms perform similarly when compared for throughput, CWND and RTT delay.
Performance 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 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 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 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 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 informationEE122 MIDTERM EXAM: Scott Shenker, Ion Stoica
EE MITERM EXM: 00-0- Scott Shenker, Ion Stoica Last name Student I First name Login: ee- Please circle the last two letters of your login. a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e
More informationBrief Overview and Background
Brief Overview and Background In this assignment you will be studying the performance behavior of TCP, using ns 2. At the end of this exercise, you should be able to write simple scripts in ns 2 as well
More informationCongestion Control. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Congestion Control Daniel Zappala CS 460 Computer Networking Brigham Young University 2/25 Congestion Control how do you send as fast as possible, without overwhelming the network? challenges the fastest
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 informationRecap. TCP connection setup/teardown Sliding window, flow control Retransmission timeouts Fairness, max-min fairness AIMD achieves max-min fairness
Recap TCP connection setup/teardown Sliding window, flow control Retransmission timeouts Fairness, max-min fairness AIMD achieves max-min fairness 81 Feedback Signals Several possible signals, with different
More informationInvestigations on TCP Behavior during Handoff
Investigations on TCP Behavior during Handoff Thomas Schwabe, Jörg Schüler Technische Universität Dresden Outlook 1. Transport Control Protocol - TCP Overview TCP versions 2. Simulation scenarios Local
More informationAdvanced Computer Networks
Advanced Computer Networks Congestion control in TCP Contents Principles TCP congestion control states Congestion Fast Recovery TCP friendly applications Prof. Andrzej Duda duda@imag.fr http://duda.imag.fr
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 informationFast Retransmit. Problem: coarsegrain. timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission
Fast Retransmit Problem: coarsegrain TCP timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission Packet 1 Packet 2 Packet 3 Packet 4 Packet 5 Packet 6 Sender Receiver
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 informationCS 5520/ECE 5590NA: Network Architecture I Spring Lecture 13: UDP and TCP
CS 5520/ECE 5590NA: Network Architecture I Spring 2008 Lecture 13: UDP and TCP Most recent lectures discussed mechanisms to make better use of the IP address space, Internet control messages, and layering
More informationPerformance Enhancement Of TCP For Wireless Network
P a g e 32 Vol. 10 Issue 12 (Ver. 1.0) October 2010 Global Journal of Computer Science and Technology Performance Enhancement Of TCP For Wireless Network 1 Pranab Kumar Dhar, 2 Mohammad Ibrahim Khan, 3
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 informationStudent ID: CS457: Computer Networking Date: 3/20/2007 Name:
CS457: Computer Networking Date: 3/20/2007 Name: Instructions: 1. Be sure that you have 9 questions 2. Be sure your answers are legible. 3. Write your Student ID at the top of every page 4. This is a closed
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 informationPERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER
PERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER Vilma Tomço, 1 Aleksandër Xhuvani 2 Abstract: The purpose of this work is
More informationTHE NETWORK PERFORMANCE OVER TCP PROTOCOL USING NS2
THE NETWORK PERFORMANCE OVER TCP PROTOCOL USING NS2 Ammar Abdulateef Hadi, Raed A. Alsaqour and Syaimak Abdul Shukor School of Computer Science, Faculty of Information Science and Technology, University
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 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 informationEquation-Based Congestion Control for Unicast Applications. Outline. Introduction. But don t we need TCP? TFRC Goals
Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley AT&T Center for Internet Research (ACIRI) Jitendra Padhye Umass Amherst Jorg Widmer International Computer Science Institute
More informationCongestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014
1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2014 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion
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 informationPerformance Consequences of Partial RED Deployment
Performance Consequences of Partial RED Deployment Brian Bowers and Nathan C. Burnett CS740 - Advanced Networks University of Wisconsin - Madison ABSTRACT The Internet is slowly adopting routers utilizing
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 informationCongestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2014
1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2014 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion
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 informationNetwork Management & Monitoring
Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end
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 informationTCP Westwood and Easy Red to Improve Fairness in High-speed Networks. PfHsn 2002 Berlin, 22 April 2002
TCP Westwood and Easy Red to Improve Fairness in High-speed Networks L. A. Grieco, S. Mascolo Dipartimento di Elettrotecnica ed Elettronica Politecnico di Bari, Italy PfHsn 2002 Berlin, 22 April 2002 Outline
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 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 informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 24: Congestion Control Prof. Alan Mislove (amislove@ccs.neu.edu) Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica,
More informationCongestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015
1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2015 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion
More informationCongestion Collapse in the 1980s
Congestion Collapse Congestion Collapse in the 1980s Early TCP used fixed size window (e.g., 8 packets) Initially fine for reliability But something happened as the ARPANET grew Links stayed busy but transfer
More informationTransport layer. UDP: User Datagram Protocol [RFC 768] Review principles: Instantiation in the Internet UDP TCP
Transport layer Review principles: Reliable data transfer Flow control Congestion control Instantiation in the Internet UDP TCP 1 UDP: User Datagram Protocol [RFC 768] No frills, bare bones Internet transport
More informationTransport layer. Review principles: Instantiation in the Internet UDP TCP. Reliable data transfer Flow control Congestion control
Transport layer Review principles: Reliable data transfer Flow control Congestion control Instantiation in the Internet UDP TCP 1 UDP: User Datagram Protocol [RFC 768] No frills, bare bones Internet transport
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 informationA framework to determine the optimal loss rate of RED queue for next generation Internet routers
A framework to determine the optimal loss rate of RED queue for next generation Internet routers Mohammed Atiquzzaman School of Computer Science, University of Oklahoma, Norman, OK 73019-6151. Email: atiq@ou.edu
More informationCS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 15: Congestion Control Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu
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 informationOn the Transition to a Low Latency TCP/IP Internet
On the Transition to a Low Latency TCP/IP Internet Bartek Wydrowski and Moshe Zukerman ARC Special Research Centre for Ultra-Broadband Information Networks, EEE Department, The University of Melbourne,
More informationRED behavior with different packet sizes
RED behavior with different packet sizes Stefaan De Cnodder, Omar Elloumi *, Kenny Pauwels Traffic and Routing Technologies project Alcatel Corporate Research Center, Francis Wellesplein, 1-18 Antwerp,
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 informationSharkFest 17 Europe. My TCP ain t your TCP. Simon Lindermann. Stack behavior back then and today. Miele & Cie KG.
SharkFest 17 Europe My TCP ain t your TCP Stack behavior back then and today 9th November 2017 Simon Lindermann Miele & Cie KG #sf17eu Estoril, Portugal#sf17eu My TCP Estoril, ain tportugal your TCP 7-10
More informationAssignment 7: TCP and Congestion Control Due the week of October 29/30, 2015
Assignment 7: TCP and Congestion Control Due the week of October 29/30, 2015 I d like to complete our exploration of TCP by taking a close look at the topic of congestion control in TCP. To prepare for
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 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 informationChapter III. congestion situation in Highspeed Networks
Chapter III Proposed model for improving the congestion situation in Highspeed Networks TCP has been the most used transport protocol for the Internet for over two decades. The scale of the Internet and
More informationCSE/EE 461 Lecture 16 TCP Congestion Control. TCP Congestion Control
CSE/EE Lecture TCP Congestion Control Tom Anderson tom@cs.washington.edu Peterson, Chapter TCP Congestion Control Goal: efficiently and fairly allocate network bandwidth Robust RTT estimation Additive
More informationTCP OVER AD HOC NETWORK
TCP OVER AD HOC NETWORK Special course on data communications and networks Zahed Iqbal (ziqbal@cc.hut.fi) Agenda Introduction Versions of TCP TCP in wireless network TCP in Ad Hoc network Conclusion References
More informationTCP Congestion Control in Wired and Wireless networks
TCP Congestion Control in Wired and Wireless networks Mohamadreza Najiminaini (mna28@cs.sfu.ca) Term Project ENSC 835 Spring 2008 Supervised by Dr. Ljiljana Trajkovic School of Engineering and Science
More informationVariable Step Fluid Simulation for Communication Network
Variable Step Fluid Simulation for Communication Network Hongjoong Kim 1 and Junsoo Lee 2 1 Korea University, Seoul, Korea, hongjoong@korea.ac.kr 2 Sookmyung Women s University, Seoul, Korea, jslee@sookmyung.ac.kr
More informationENSC 835: COMMUNICATION NETWORKS
ENSC 835: COMMUNICATION NETWORKS Evaluation of TCP congestion control mechanisms using OPNET simulator Spring 2008 FINAL PROJECT REPORT LAXMI SUBEDI http://www.sfu.ca/~lsa38/project.html lsa38@cs.sfu.ca
More informationReview: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model
Review: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model Rakesh K Scholar (M.Tech) The Oxford College of Engineering Bangalore Mrs. Kalaiselvi Asst. Prof,
More informationRobust TCP Congestion Recovery
Robust TCP Congestion Recovery Haining Wang Kang G. Shin Computer Science Department EECS Department College of William and Mary The University of Michigan Williamsburg, VA 23187 Ann Arbor, MI 48109 hnw@cs.wm.edu
More informationTCP Westwood: Efficient Transport for High-speed wired/wireless Networks
TCP Westwood: Efficient Transport for High-speed wired/wireless Networks Mario Gerla, Medy Sanadidi, Ren Wang and Massimo Valla UCLA Computer Science 1 Outline 1. TCP Overview 2. Bandwidth Estimation and
More informationLecture 4: Congestion Control
Lecture 4: Congestion Control Overview Internet is a network of networks Narrow waist of IP: unreliable, best-effort datagram delivery Packet forwarding: input port to output port Routing protocols: computing
More informationCOMP/ELEC 429/556 Introduction to Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks The TCP Protocol Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu
More informationInternet Protocols Fall Lecture 16 TCP Flavors, RED, ECN Andreas Terzis
Internet Protocols Fall 2006 Lecture 16 TCP Flavors, RED, ECN Andreas Terzis Outline TCP congestion control Quick Review TCP flavors Impact of losses Cheating Router-based support RED ECN CS 349/Fall06
More informationTCP VARIANTS TO CONTROL CONGESTION
TCP VARIANTS TO CONTROL CONGESTION Harjinder Kaur 1, Manvinder Singh 2 1,2 University College of Computer Applications, Guru Kashi University, Talwandi Sabo (India) ABSTRACT TCP is used to control the
More informationChapter II. Protocols for High Speed Networks. 2.1 Need for alternative Protocols
Chapter II Protocols for High Speed Networks 2.1 Need for alternative Protocols As the conventional TCP suffers from poor performance on high bandwidth delay product links [47] meant for supporting transmission
More informationPage 1. Review: Internet Protocol Stack. Transport Layer Services. Design Issue EEC173B/ECS152C. Review: TCP
EEC7B/ECS5C Review: Internet Protocol Stack Review: TCP Application Telnet FTP HTTP Transport Network Link Physical bits on wire TCP LAN IP UDP Packet radio Transport Layer Services Design Issue Underlying
More informationPage 1. Review: Internet Protocol Stack. Transport Layer Services EEC173B/ECS152C. Review: TCP. Transport Layer: Connectionless Service
EEC7B/ECS5C Review: Internet Protocol Stack Review: TCP Application Telnet FTP HTTP Transport Network Link Physical bits on wire TCP LAN IP UDP Packet radio Do you remember the various mechanisms we have
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 informationFuzzy based Tuning Congestion Window for Improving End-to-End Congestion Control Protocols
Fuzzy based Tuning Congestion Window for Improving End-to-End Congestion Control Protocols Tharwat Ibrahim Department of Computer Systems Faculty of Computer and Information, Benha University Gamal Attiya
More informationROBUST TCP: AN IMPROVEMENT ON TCP PROTOCOL
ROBUST TCP: AN IMPROVEMENT ON TCP PROTOCOL SEIFEDDINE KADRY 1, ISSA KAMAR 1, ALI KALAKECH 2, MOHAMAD SMAILI 1 1 Lebanese University - Faculty of Science, Lebanon 1 Lebanese University - Faculty of Business,
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 informationAdvanced Computer Networks
Advanced Computer Networks Congestion control in TCP Prof. Andrzej Duda duda@imag.fr http://duda.imag.fr 1 Contents Principles TCP congestion control states Slow Start Congestion Avoidance Fast Recovery
More informationThe Transport Layer Congestion control in TCP
CPSC 360 Network Programming The Transport Layer Congestion control in TCP Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu http://www.cs.clemson.edu/~mweigle/courses/cpsc360
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 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 informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 14 Congestion Control Some images courtesy David Wetherall Animations by Nick McKeown and Guido Appenzeller The bad news and the good news The bad news: new
More informationCS519: Computer Networks. Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control
: Computer Networks Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control TCP performance We ve seen how TCP the protocol works Sequencing, receive window, connection setup and teardown And
More informationUNIT IV -- TRANSPORT LAYER
UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission
More informationRecap. More TCP. Congestion avoidance. TCP timers. TCP lifeline. Application Presentation Session Transport Network Data Link Physical
Recap ½ congestion window ½ congestion window More TCP Congestion avoidance TCP timers TCP lifeline Application Presentation Session Transport Network Data Link Physical 1 Congestion Control vs Avoidance
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 informationMEASURING PERFORMANCE OF VARIANTS OF TCP CONGESTION CONTROL PROTOCOLS
MEASURING PERFORMANCE OF VARIANTS OF TCP CONGESTION CONTROL PROTOCOLS Harjinder Kaur CSE, GZSCCET, Dabwali Road, Bathinda, Punjab, India, sidhuharryab@gmail.com Gurpreet Singh Abstract CSE, GZSCCET, Dabwali
More informationTransport Layer (Congestion Control)
Transport Layer (Congestion Control) Where we are in the Course Moving on up to the Transport Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Congestion Collapse Congestion
More informationTCP/IP over ATM using ABR, UBR, and GFR Services
TCP/IP over ATM using ABR, UBR, and GFR Services Columbus, OH 43210 Jain@CIS.Ohio-State.Edu http://www.cis.ohio-state.edu/~jain/ 1 Overview Why ATM? ABR: Binary and Explicit Feedback ABR Vs UBR TCP/IP
More informationTransport Layer PREPARED BY AHMED ABDEL-RAOUF
Transport Layer PREPARED BY AHMED ABDEL-RAOUF TCP Flow Control TCP Flow Control 32 bits source port # dest port # head len sequence number acknowledgement number not used U A P R S F checksum Receive window
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 informationECE 461 Internetworking. Problem Sheet 6
ECE 461 Internetworking Problem Sheet 6 Problem 1. Consider the state of a sliding window at the sending side of a TCP connections as shown in Figure 1. (Each number corresponds to one byte).. (a) Explain
More informationCMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 30, 2018
CMSC 417 Computer Networks Prof. Ashok K Agrawala 2018 Ashok Agrawala October 30, 2018 Message, Segment, Packet, and Frame host host HTTP HTTP message HTTP TCP TCP segment TCP router router IP IP packet
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 informationOperating Systems and Networks. Network Lecture 10: Congestion Control. Adrian Perrig Network Security Group ETH Zürich
Operating Systems and Networks Network Lecture 10: Congestion Control Adrian Perrig Network Security Group ETH Zürich Where we are in the Course More fun in the Transport Layer! The mystery of congestion
More informationWhere we are in the Course. Topic. Nature of Congestion. Nature of Congestion (3) Nature of Congestion (2) Operating Systems and Networks
Operating Systems and Networks Network Lecture 0: Congestion Control Adrian Perrig Network Security Group ETH Zürich Where we are in the Course More fun in the Transport Layer! The mystery of congestion
More informationENRICHMENT OF SACK TCP PERFORMANCE BY DELAYING FAST RECOVERY Mr. R. D. Mehta 1, Dr. C. H. Vithalani 2, Dr. N. N. Jani 3
Research Article ENRICHMENT OF SACK TCP PERFORMANCE BY DELAYING FAST RECOVERY Mr. R. D. Mehta 1, Dr. C. H. Vithalani 2, Dr. N. N. Jani 3 Address for Correspondence 1 Asst. Professor, Department of Electronics
More informationECE 610: Homework 4 Problems are taken from Kurose and Ross.
ECE 610: Homework 4 Problems are taken from Kurose and Ross. Problem 1: Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 248. Suppose
More informationCross-layer TCP Performance Analysis in IEEE Vehicular Environments
24 Telfor Journal, Vol. 6, No. 1, 214. Cross-layer TCP Performance Analysis in IEEE 82.11 Vehicular Environments Toni Janevski, Senior Member, IEEE, and Ivan Petrov 1 Abstract In this paper we provide
More informationEvaluation of Advanced TCP Stacks on Fast Long-Distance Production Networks p. 1
Evaluation of Advanced TCP Stacks on Fast Long-Distance Production Networks Hadrien Bullot & R. Les Cottrell {hadrien,cottrell}@slac.stanford.edu Stanford Linear Accelerator Center, Menlo Park Evaluation
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 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 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 informationCongestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015
Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2015 1 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion
More information