Oscillation of RED with 2way TCP bulk data traffic

Size: px
Start display at page:

Download "Oscillation of RED with 2way TCP bulk data traffic"

Transcription

1 First Author: Oscillation of RED with way TCP bulk data traffic Thomas Ziegler, Salzburg Polytechnic University; Second Author: Bernhard Hechenleitner, Salzburg Polytechnic University; Date: --8 Document type: Technical Report Status: Keywords: Draft Congestion Control, TCP, RED Gateways Abstract/Introduction This report aims at proofing that our simulation results [Zieg99] can be applied to the real network situation. By simulation we found that RED s queuesize oscillates heavily in scenarios with bi-directional TCP bulk-data traffic. These oscillations happen independently of the setting of RED parameters (maxp, wq, maxth, minth) and scenario-parameters (distribution of propagation delay, number of TCP flows, MTU size and bottleneck bandwidth). Furthermore, [Zieg99] proposes models (verified by simulation) how to set RED s parameters as a function of the scenario-parameters. The measurements in this report show that the simulation-results are indeed valid for the real Internet, resulting in severe headaches regarding the deployment of RED. It is questionable that RED parameters can be set properly in the case of uni-directional TCP flows as this would require knowledge of the flow RTT distribution and the number of flows. In case of bi-directional TCP flows (which is the standard-situation in the Internet) oscillations can not be avoided. These queue-size oscillations cause periods of linkunder-utilization followed by periods of vast packet drops due to buffer-overflow, i.e. sub-optimal network-power. Additionally, due to these oscillations, RED-based preferential drop-mechanisms (WRED, RIO) required for the Differentiated Services Internet provide poor service-discrimination among in-profile and out-of-profile packets. In order to enable comfortable measurements with minimum errors a generic measurement environment has been developed. This software is written in TCL, uses standard UNIX commands for process-generation on remote-hosts and standard tools like ttcp and tcpdump to generate traffic and retrieve results. In section, we describe the configuration of this software to perform one-way delay measurements with a GPS clock. The one-way delay of packets directly corresponds to the queueing-delay at the congested router output-port, i.e. the instantaneous RED queue-size. Generic Measurement Environment (GME) The GME enables flexible and comfortable performance evaluation by measurement in the Internet. The main-program (a TCL script) is running at the GME-Server, controlling the entire measurement-process. This script in turn creates and distributes scripts for flow-generation and traffic monitoring, starts flows and traffic-monitors on remote hosts, and finally gathers the measurement results at the GME-server after the measurement has terminated. For generation of flows the "ttcp" tool is used: first a ttcp server (receiver) has to be started at the receiving host with "ttcp -rs -p x". The option "-rs" tells ttcp to operate as data-receiver tcp and to discard all incoming data; "-p x" specifies the portnum- - -

2 ber to listen at. then the ttcp sender is started with "ttcp -ts -p x receiving-host". The "-ts" option tells ttcp the operate as transmitter and to source arbitrary data into the net to the host running the ttcp receiver with portnumber "x". The ttcp sender is aware of several other TCP-specific options and additionally allows creation of UDP flows. Traffic monitoring is performed with tcpdump. Tcpdump switches a host s ethernet-interface into promiscious mode and dumps header-information of all packets broadcasted at the Ethernet Segment matching a filter condition. For instance, in order to filter all packets of one TCP flow from host A to host B with source port-number 7, the call to tcpdump is as follows: "tcpdump src host A and dst host B and proto TCP and src port 7" For remote procedure calls and file-copying the standard Unix-commands rsh and rcp are used. Note that for proper operation of the rsh and rcp commands ".rhosts files" are required at remote hosts enabling access from the GME-server. The main TCL script running at the GME-server can be outlined as follows:. create traffic-files, send traffic-files to hosts: there are two types of traffic-files: receiver-files: shell scripts starting ttcp receivers and sender-files starting ttcp senders. Among a sender-file on a host A and a receiverfile on a host be exists a one-to-one relation determining the traffic-flows: for each ttcp-receiver process on host B listening on port C, a ttcp sender is created (with adjustable options) sending to host B, port C. In the current version of GME, all ttcp senders in one sender-file start immediately. However, in future versions the individual ttcp sender processes can be scheduled at arbitrary points time (this would be facilitated by running TCL not only at the CME-Server but also at the remote hosts running the trafficfiles). After creation of the sender- and receiver-files for host A and B the sender file is copied to host A; the receiver file is copied to host B with the Unix command "rcp".. create tcpdump-files, send tcpdump files to hosts. Tcpdump files are shell scripts containing one line of code, starting tcpdump with a filter-function (see above).. Start tcpdump files: the tcpdump-files are started with the "rsh" command as background processes on remote hosts.. start ttcp receivers: the ttcp receiver-files are started with the "rsh" command as background processes. Note that it is important to start the ttcp receivers earlier than the ttcp senders as ttcp receivers and senders have a client-server relationship. 5. start ttcp senders: the ttcp sender-files are started with the "rsh" command as background processes. As the remote hosts are not time-synchronized it may happen that two sender-files at two distinct remote hosts are not started at the same point in time. Assume that the delay from the CME-server to a host A is longer than the delay between CME-server and a host B or, assume that some rsh-packets are lost on the way to host A and all rsh.packets to host B arrive. In both cases the sender-file at host B (and thereby the ttcp flows at host B) will be started before the sender file at host A. It is the responsibility of the engineer to estimate whether the connectivity between CME-caller and the remote hosts is sufficient to satisfy the time-accuracy required for a specific measurement. For future versions of the tool an intelligent agent would be desirable, detecting the delayed start of ttcp flows and terminating the measurement in case accuracy requirements are not met. 6. wait for the estimated duration of the measurements 7. gather ttcp results: each ttcp-result contains the measurement results for a single tcp (or udp) flow. All ttcp-result files are copied from the remote hosts to the CME-sever by rcp. - -

3 8. gather tcpdump results. TCPdump result files are copied from the remote hosts to the CME-sever by rcp. Network Configuration host host host hub router router hub host5 host host6 router host7 Figure Measured network Hardware: hosts-6: PC Pentium, 5MHz, 8MB RAM host7: PC Pentium MMX, MHz hub,: Bay Networks / Mbps Ethernet Hub router,: Cisco 6, IOS. T router: Cisco 5, IOS. T Links: hosts -6 to Hubs:Mbps Ethernet host7 to router: Mbps Ethernet router to hub: Mbps Ethernet router to hub: Mbps Ethernet router to hubs: Mbps Ethernet router to router: Serial link running HDLC, bandwidth 5kbps The propagation delay of all links can be assumed zero (all equipment is located in one lab). The configuration is slightly non-symmetric as router is connected to hub with Mbps Ethernet, whereas router is connected to hub with Mbps Ethernet. This asymmetry could not be avoided as only one Mbps Ethernet port has been available for the 6er routers. However, if the bottleneck capacity (router- router) is sufficiently low (e.g. 5kbps for the two-way TCP scenarios), this asymmetry does not influence the measurement results as collisions at the Mbps Ethernet are negligible. In earlier scenarios the bottleneck capacity has been set to Mbps, causing a significant amount of collisions (showing TCP s burstiness) and thereby falsifying the measurement results. GME usage for one-way Delay Measurements in the Testbed In this section we show a sample application of GME; one-way delay measurements in the testbed specified in section. - -

4 The ttcp flows are created (as explained in section ) from host to host, host to host 5, host to host and host 5 to host. Host and host 6 are time-synchronized by a GPS clock. Additionally these hosts are running tcpdump. Two one-way delay measurements are performed: ttcp flow A from host to host is tcpdumped at host and host ttcp flow B from host to host is tcpdumped at host and host Tcpdump stores the time a packet is received and the TCP sequence number in a result-file. By relating the sequence numbers of ttcp flow A in the result-files at host and host and subtracting the arrival time of a TCP segment at host from the arrival time of the TCP segment at host the one-way delay can be measured. This equally valid for ttcp flow B. This configuration minimizes measurement errors as there is no traffic created during the execution of the measurement but the flows to be measured. Additionally, tcp-dumping is completely separated from the the task of traffic-generation as this happens on different hosts. Hence the GME does not at all influence the measured system (falsifications due to Heisenberg s uncertainty principle are minimized). 5 Measurements with two-way TCP traffic Common parameters for all measurements: Bottleneck bandwidth 5kbps; switching delay in routers ms, propagation delay ms. All TCP flows start at the beginning of the measurement Measurement: Traffic: tcp flows host -> host, host -> host5, host5 -> host, host -> host (8 in total) Red parameters: minth, maxth 6, buffersize, wq., maxp / Figure one-way delay in forward and backward direction Figure shows that the one-way delay oscillates heavily between and.5 seconds. The oscillations at the two RED-gateways are phase-shifted by exactly 8 degree. The one way delay is directly related to the instantaneous queue-size at the RED gateway: queue-size - - =

5 bottleneck-bandwidth / one-way delay. As shown by figure the measurement confirms the simulation results: RED oscillates with way long-living TCP traffic, causing undesirable behavior as explained in and [Zieg99]. Measurement: Traffic: 7 tcp flows host -> host, host -> host5, host5 -> host, host -> host (8 in total) Red parameters: minth, maxth 6, buffersize, wq., maxp / Figure one-way delay in forward and backward direction Measurement: Traffic: tcp flows host -> host, host -> host5, host5 -> host, host -> host ( in total) Red parameters: minth, maxth 6, buffersize, wq., maxp / Figure one-way delay in forward and backward direction - 5 -

6 Figure and figure show that the frequency of oscillation is less constant in case of higher per-tcpflow throughput. However, the basic behavior remains (8 degree phase shift, oscillations between zero and seconds - corresponding to queue-oscillations between zero and the total buffersize) In summary, measurements - show that oscillations happen independently of the number of TCP flows. Measurements and 5 repeat measurements and, but with wq set to.8. Measurement: Traffic: tcp flows host -> host, host -> host5, host5 -> host, host -> host (8 in total) Red parameters: minth, maxth 6, buffersize, wq.8, maxp / Figure 5 one-way delay in forward and backward direction Measurement5: Traffic: tcp flows host -> host, host -> host5, host5 -> host, host -> host ( in total) Red parameters: minth, maxth 6, buffersize, wq.8, maxp / - 6 -

7 Figure 6 one-way delay in forward and backward direction As shown in figure 5 and figure 6, changing wq to.8 does not significantly affect the result. Measurement6: Traffic: 7 tcp flows host -> host, host -> host5, host5 -> host, host -> host (8 in total) Red parameters: minth 7, maxth, buffersize 5, wq.8, maxp / Figure 7 one-way delay in forward and backward direction - 7 -

8 Measurement7: Traffic: tcp flows host -> host, host -> host5, host5 -> host, host -> host ( in total) Red parameters: minth 7, maxth, buffersize 5, wq.8, maxp / Figure 8 one-way delay in forward and backward direction As shown in figure 7 and figure 8, the oscillations persist in case of lower minth, maxth and buffersize parameters. Obviously, the maximum delay decreases compared to measurements -5, as the queueing delay is shorter. 6 Conclusions The measurements in this report verify the simulation results in [Zieg99]. Oscillation of the RED queue is indeed a problem in case of way TCP traffic and places severe concerns on the deployment of RED. Future work: proposal of queue-management algorithms avoiding the queue-size oscillations quantitative evaluation of the influence of queuesize oscillations on the service-discrimination among in-profile and out-of-profile packets with WRED or RIO more investigations on RED parameter settings 7 Acknowledgements The authors would like to thank Florian Guma from Salzburg Polytechnic University for his greatful technical support. 8 References [Zieg99] T. Ziegler, S. Fdida, "Stability Criteria for RED with bulk-data TCP traffic", technical report,

Investigating the Use of Synchronized Clocks in TCP Congestion Control

Investigating 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 information

A 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 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 information

RED behavior with different packet sizes

RED 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 information

Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways

Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways Haowei Bai Honeywell Aerospace Mohammed Atiquzzaman School of Computer Science University of Oklahoma 1 Outline Introduction

More information

Router s Queue Management

Router s Queue Management Router s Queue Management Manages sharing of (i) buffer space (ii) bandwidth Q1: Which packet to drop when queue is full? Q2: Which packet to send next? FIFO + Drop Tail Keep a single queue Answer to Q1:

More information

Congestion 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 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 information

The War Between Mice and Elephants

The 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 information

Congestion Control for High Bandwidth-delay Product Networks

Congestion 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 information

Streaming Video and TCP-Friendly Congestion Control

Streaming Video and TCP-Friendly Congestion Control Streaming Video and TCP-Friendly Congestion Control Sugih Jamin Department of EECS University of Michigan jamin@eecs.umich.edu Joint work with: Zhiheng Wang (UofM), Sujata Banerjee (HP Labs) Video Application

More information

EE 122: Router Support for Congestion Control: RED and Fair Queueing. Ion Stoica Oct. 30 Nov. 4, 2002

EE 122: Router Support for Congestion Control: RED and Fair Queueing. Ion Stoica Oct. 30 Nov. 4, 2002 EE 122: Router Support for Congestion Control: RED and Fair Queueing Ion Stoica Oct. 30 Nov. 4, 2002 Router Support For Congestion Management Traditional Internet - Congestion control mechanisms at end-systems,

More information

Tuning RED for Web Traffic

Tuning RED for Web Traffic Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC, Chapel Hill SIGCOMM 2000, Stockholm subsequently IEEE/ACM Transactions on Networking Vol. 9, No. 3 (June 2001)

More information

A distributed Mechanism for Identification and Discrimination of non TCP-friendly Flows in the Internet

A distributed Mechanism for Identification and Discrimination of non TCP-friendly Flows in the Internet A distributed Mechanism for Identification and Discrimination of non TCP-friendly Flows in the Internet Thomas Ziegler 1,2, Serge Fdida 1 * 1 Université Pierre et Marie Curie, Laboratoire Paris 6; 75015

More information

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers

Overview. 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 information

Internet Protocols Fall Lecture 16 TCP Flavors, RED, ECN Andreas Terzis

Internet 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 information

Markov Model Based Congestion Control for TCP

Markov Model Based Congestion Control for TCP Markov Model Based Congestion Control for TCP Shan Suthaharan University of North Carolina at Greensboro, Greensboro, NC 27402, USA ssuthaharan@uncg.edu Abstract The Random Early Detection (RED) scheme

More information

Network Management & Monitoring

Network 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 information

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which

More information

Random Early Detection (RED) gateways. Sally Floyd CS 268: Computer Networks

Random Early Detection (RED) gateways. Sally Floyd CS 268: Computer Networks Random Early Detection (RED) gateways Sally Floyd CS 268: Computer Networks floyd@eelblgov March 20, 1995 1 The Environment Feedback-based transport protocols (eg, TCP) Problems with current Drop-Tail

More information

EECS 122: Introduction to Communication Networks Final Exam Solutions

EECS 122: Introduction to Communication Networks Final Exam Solutions EECS 22: Introduction to Communication Networks Final Exam Solutions Problem. (6 points) How long does it take for a 3000-byte IP packet to go from host A to host B in the figure below. Assume the overhead

More information

CSE 573S Protocols for Computer Networks (Spring 2005 Final Project)

CSE 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 information

Queuing Mechanisms. Overview. Objectives

Queuing Mechanisms. Overview. Objectives Queuing Mechanisms Overview Objectives This module describes the queuing mechanisms that can be used on output interfaces. It includes the following topics: Queuing Overview FIFO Queuing Priority Queuing

More information

Media Access Control (MAC) Sub-layer and Ethernet

Media Access Control (MAC) Sub-layer and Ethernet Media Access Control (MAC) Sub-layer and Ethernet Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF MAC Sub-layer The MAC sub-layer is a sub-layer

More information

Question 7: What are Asynchronous links?

Question 7: What are Asynchronous links? Question 1:.What is three types of LAN traffic? Unicasts - intended for one host. Broadcasts - intended for everyone. Multicasts - intended for an only a subset or group within an entire network. Question2:

More information

Investigating the Use of Synchronized Clocks in TCP Congestion Control

Investigating 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 information

Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste

Outline 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 information

Analyzing the Receiver Window Modification Scheme of TCP Queues

Analyzing the Receiver Window Modification Scheme of TCP Queues Analyzing the Receiver Window Modification Scheme of TCP Queues Visvasuresh Victor Govindaswamy University of Texas at Arlington Texas, USA victor@uta.edu Gergely Záruba University of Texas at Arlington

More information

Documents. Configuration. Important Dependent Parameters (Approximate) Version 2.3 (Wed, Dec 1, 2010, 1225 hours)

Documents. Configuration. Important Dependent Parameters (Approximate) Version 2.3 (Wed, Dec 1, 2010, 1225 hours) 1 of 7 12/2/2010 11:31 AM Version 2.3 (Wed, Dec 1, 2010, 1225 hours) Notation And Abbreviations preliminaries TCP Experiment 2 TCP Experiment 1 Remarks How To Design A TCP Experiment KB (KiloBytes = 1,000

More information

Equation-Based Congestion Control for Unicast Applications. Outline. Introduction. But don t we need TCP? TFRC Goals

Equation-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 information

Introduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15

Introduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15 Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay

More information

The Effects of Asymmetry on TCP Performance

The Effects of Asymmetry on TCP Performance The Effects of Asymmetry on TCP Performance Hari Balakrishnan Venkata N. Padmanabhan Randy H. Katz University of California at Berkeley Daedalus/BARWAN Retreat June 1997 Outline Overview Bandwidth asymmetry

More information

TCP in Asymmetric Environments

TCP in Asymmetric Environments TCP in Asymmetric Environments KReSIT, IIT Bombay Vijay T. Raisinghani TCP in Asymmetric Environments 1 TCP Overview Four congestion control algorithms Slow start Congestion avoidance Fast retransmit Fast

More information

Appendix B. Standards-Track TCP Evaluation

Appendix 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 information

Impact of TCP Window Size on a File Transfer

Impact of TCP Window Size on a File Transfer Impact of TCP Window Size on a File Transfer Introduction This example shows how ACE diagnoses and visualizes application and network problems; it is not a step-by-step tutorial. If you have experience

More information

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012 CSE 473 Introduction to Computer Networks Jon Turner Final Exam Your name here: 12/17/2012 1. (8 points). The figure below shows a network path connecting a server to a client. 200 km 2000 km 2 km X Y

More information

Validation of Router Models in OPNET

Validation of Router Models in OPNET Validation of Router Models in OPNET B. Van den Broeck, P. Leys, J. Potemans 1, J. Theunis, E. Van Lil, A. Van de Capelle Katholieke Universiteit Leuven (K.U.Leuven) Department of Electrical Engineering

More information

Appendix A. Methodology

Appendix A. Methodology 193 Appendix A Methodology In this appendix, I present additional details of the evaluation of Sync-TCP described in Chapter 4. In Section A.1, I discuss decisions made in the design of the network configuration.

More information

CSE 473 Introduction to Computer Networks. Midterm Exam Review

CSE 473 Introduction to Computer Networks. Midterm Exam Review CSE 473 Introduction to Computer Networks Midterm Exam Review John DeHart 10/12/2015 1. (10 points). A user in Chicago, connected to the internet via a 100 Mb/s (b=bits) connection retrieves a 250 KB (B=bytes)

More information

Basic Reliable Transport Protocols

Basic Reliable Transport Protocols Basic Reliable Transport Protocols Do not be alarmed by the length of this guide. There are a lot of pictures. You ve seen in lecture that most of the networks we re dealing with are best-effort : they

More information

Integrated and Differentiated Services. Christos Papadopoulos. CSU CS557, Fall 2017

Integrated and Differentiated Services. Christos Papadopoulos. CSU CS557, Fall 2017 Integrated and Differentiated Services Christos Papadopoulos (Remixed by Lorenzo De Carli) CSU CS557, Fall 2017 1 Preliminary concepts: token buffer 2 Characterizing Traffic: Token Bucket Filter Parsimonious

More information

Congestion. Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets limited resources

Congestion. 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 information

QoS for Real Time Applications over Next Generation Data Networks

QoS for Real Time Applications over Next Generation Data Networks QoS for Real Time Applications over Next Generation Data Networks Final Project Presentation December 8, 2000 http://www.engr.udayton.edu/faculty/matiquzz/pres/qos-final.pdf University of Dayton Mohammed

More information

CS4700/CS5700 Fundamentals of Computer Networks

CS4700/CS5700 Fundamentals of Computer Networks CS4700/CS5700 Fundamentals of Computer Networks Lecture 16: Congestion control II Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu

More information

Communication Networks

Communication 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 information

Random Early Detection Gateways for Congestion Avoidance

Random Early Detection Gateways for Congestion Avoidance Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California floyd@eelblgov van@eelblgov To appear in the August 1993 IEEE/ACM

More information

Fast Retransmit. Problem: coarsegrain. timeouts lead to idle periods Fast retransmit: use duplicate ACKs to trigger retransmission

Fast 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 information

EPH - International Journal of Science And Engineering

EPH - International Journal of Science And Engineering Implementation of the RED Mechanism for Congestion Avoidance Using C++ Language Haytham Ahmed Information Technology, Faculty of computer &information Technology, University of Jeddah, KSA. (E-mail id:

More information

Brief Overview and Background

Brief 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 information

Physical and Link Layers. CS144 Review Session 6 November 6 th, 2008 Roger Liao Based on slides by Ben Nham

Physical and Link Layers. CS144 Review Session 6 November 6 th, 2008 Roger Liao Based on slides by Ben Nham Physical and Link Layers CS144 Review Session 6 November 6 th, 2008 Roger Liao Based on slides by Ben Nham Outline Physical layer Encoding of signals Chips vs. bits Link layer Communication through shared

More information

Your favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY

Your favorite blog :www.vijay-jotani.weebly.com (popularly known as VIJAY JOTANI S BLOG..now in facebook.join ON FB VIJAY VISIT: Course Code : MCS-042 Course Title : Data Communication and Computer Network Assignment Number : MCA (4)/042/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15 th

More information

Cisco Exam Cisco Interconnecting Cisco Networking Devices Part 1 (ICND) Version: 12.0 [ Total Questions: 202 ]

Cisco Exam Cisco Interconnecting Cisco Networking Devices Part 1 (ICND) Version: 12.0 [ Total Questions: 202 ] s@lm@n Cisco Exam 100-101 Cisco Interconnecting Cisco Networking Devices Part 1 (ICND) Version: 12.0 [ Total Questions: 202 ] Topic 7, Troubleshooting Cisco 100-101 : Practice Test Question No : 1 - (Topic

More information

WEB APPLICATION PERFORMANCE PREDICTION

WEB APPLICATION PERFORMANCE PREDICTION WEB APPLICATION PERFORMANCE PREDICTION by Himadeepa Karlapudi Submitted to the graduate faculty of the Department of Computer Science In Partial Fulfillment of the Requirements for the Degree of Master

More information

8. TCP Congestion Control

8. 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 information

Outline 9.2. TCP for 2.5G/3G wireless

Outline 9.2. TCP for 2.5G/3G wireless Transport layer 9.1 Outline Motivation, TCP-mechanisms Classical approaches (Indirect TCP, Snooping TCP, Mobile TCP) PEPs in general Additional optimizations (Fast retransmit/recovery, Transmission freezing,

More information

Oscillations and Buffer Overflows in Video Streaming under Non- Negligible Queuing Delay

Oscillations and Buffer Overflows in Video Streaming under Non- Negligible Queuing Delay Oscillations and Buffer Overflows in Video Streaming under Non- Negligible Queuing Delay Presented by Seong-Ryong Kang Yueping Zhang and Dmitri Loguinov Department of Computer Science Texas A&M University

More information

Lecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Lecture 2 Communication services The Trasport Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Lecture 2 Communication services The Trasport Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it The structure edge: applications and hosts core: routers of s access s, media:

More information

Housekeeping. Fall /5 CptS/EE 555 1

Housekeeping. Fall /5 CptS/EE 555 1 Housekeeping Lab access HW turn-in Jin? Class preparation for next time: look at the section on CRCs 2.4.3. Be prepared to explain how/why the shift register implements the CRC Skip Token Rings section

More information

XCP: explicit Control Protocol

XCP: explicit Control Protocol XCP: explicit Control Protocol Dina Katabi MIT Lab for Computer Science dk@mit.edu www.ana.lcs.mit.edu/dina Sharing the Internet Infrastructure Is fundamental Much research in Congestion Control, QoS,

More information

Just enough TCP/IP. Protocol Overview. Connection Types in TCP/IP. Control Mechanisms. Borrowed from my ITS475/575 class the ITL

Just enough TCP/IP. Protocol Overview. Connection Types in TCP/IP. Control Mechanisms. Borrowed from my ITS475/575 class the ITL Just enough TCP/IP Borrowed from my ITS475/575 class the ITL 1 Protocol Overview E-Mail HTTP (WWW) Remote Login File Transfer TCP UDP RTP RTCP SCTP IP ICMP ARP RARP (Auxiliary Services) Ethernet, X.25,

More information

Random Early Detection Gateways for Congestion Avoidance

Random Early Detection Gateways for Congestion Avoidance Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California floyd@eelblgov van@eelblgov To appear in the August 1993 IEEE/ACM

More information

Introduction to Quality of Service

Introduction to Quality of Service Introduction to Quality of Service The use of IP as a foundation for converged networks has raised several issues for both enterprise IT departments and ISPs. IP and Ethernet are connectionless technologies

More information

Outline. Internet. Router. Network Model. Internet Protocol (IP) Design Principles

Outline. Internet. Router. Network Model. Internet Protocol (IP) Design Principles Outline Internet model Design principles Internet Protocol (IP) Transmission Control Protocol (TCP) Tze Sing Eugene Ng Department of Computer Science Carnegie Mellon University Tze Sing Eugene Ng eugeneng@cs.cmu.edu

More information

CS244a: An Introduction to Computer Networks

CS244a: An Introduction to Computer Networks Grade: MC: 7: 8: 9: 10: 11: 12: 13: 14: Total: CS244a: An Introduction to Computer Networks Final Exam: Wednesday You are allowed 2 hours to complete this exam. (i) This exam is closed book and closed

More information

Flow & Congestion Control

Flow & Congestion Control Read 7.E & 7.F Flow & Congestion Control Prof. Dina Kat abi Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden 1 This Lecture More about Sliding

More information

CSE/EE 461 Lecture 16 TCP Congestion Control. TCP Congestion Control

CSE/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 information

Reliable File Transfer

Reliable File Transfer Due date Wednesday, Mar 14, 11:59pm Reliable File Transfer CS 5565 Spring 2012, Project 2 This project is worth 100 points. You may form teams of up to two students for this project. You are not required

More information

Congestion control in TCP

Congestion 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 information

Configuring Cisco IOS IP SLAs Operations

Configuring Cisco IOS IP SLAs Operations CHAPTER 39 This chapter describes how to use Cisco IOS IP Service Level Agreements (SLAs) on the switch. Cisco IP SLAs is a part of Cisco IOS software that allows Cisco customers to analyze IP service

More information

Circuit Breakers for Multimedia Congestion Control

Circuit Breakers for Multimedia Congestion Control Circuit Breakers for Multimedia Congestion Control Varun Singh Aalto University Stephen McQuistin, Martin Ellis, and Colin Perkins University of Glasgow Context Video conferencing seeing increasing deployment

More information

Lecture 14: Congestion Control"

Lecture 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 information

Global Interface Commands on the Cisco ASR 9000 Series Router

Global Interface Commands on the Cisco ASR 9000 Series Router Global Interface Commands on the Cisco ASR 9000 Series Router This module provides global command line interface (CLI) commands for configuring interfaces on the Cisco ASR 9000 Series Aggregation Services

More information

CMSC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. October 30, 2018

CMSC 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 information

Mobile Transport Layer

Mobile Transport Layer Mobile Transport Layer 1 Transport Layer HTTP (used by web services) typically uses TCP Reliable transport between TCP client and server required - Stream oriented, not transaction oriented - Network friendly:

More information

Three-section Random Early Detection (TRED)

Three-section Random Early Detection (TRED) Three-section Random Early Detection (TRED) Keerthi M PG Student Federal Institute of Science and Technology, Angamaly, Kerala Abstract There are many Active Queue Management (AQM) mechanisms for Congestion

More information

A Congestion Avoidance Approach in Jumbo Frameenabled

A Congestion Avoidance Approach in Jumbo Frameenabled A Congestion Avoidance Approach in Jumbo Frameenabled IP Network Aos Anas Mulahuwaish, Kamalrulnizam Abu Bakar, Kayhan Zrar Ghafoor Faculty of Computer Science and Information System Universiti Teknologi

More information

An Implementation of a Service Class Providing Assured TCP Rates within the AQUILA Framework

An Implementation of a Service Class Providing Assured TCP Rates within the AQUILA Framework An Implementation of a Service Class Providing Assured TCP Rates within the AQUILA Framework Christof Brandauer and Peter Dorfinger Salzburg Research, Jakob-Haringer-Str. 5/III, A-5020 Salzburg, Austria

More information

Computer Networks. Routing

Computer Networks. Routing Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding

More information

Question Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100

Question Score 1 / 19 2 / 19 3 / 16 4 / 29 5 / 17 Total / 100 NAME: Login name: Computer Science 461 Midterm Exam March 10, 2010 3:00-4:20pm This test has five (5) questions. Put your name on every page, and write out and sign the Honor Code pledge before turning

More information

Hubs. twisted pair. hub. 5: DataLink Layer 5-1

Hubs. twisted pair. hub. 5: DataLink Layer 5-1 Hubs Hubs are essentially physical-layer repeaters: bits coming from one link go out all other links at the same rate no frame buffering no CSMA/CD at : adapters detect collisions provides net management

More information

Global Interface Commands on the. Cisco ASR 9000 Series Router.

Global Interface Commands on the. Cisco ASR 9000 Series Router. Global Interface Commands on the Cisco ASR 9000 Series Router This module describes the global command line interface (CLI) commands for configuring interfaces on the Cisco ASR 9000 Series Router. bandwidth

More information

Network Management & Monitoring Network Delay

Network Management & Monitoring Network Delay 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 information

6.033 Computer System Engineering

6.033 Computer System Engineering MIT OpenCourseWare http://ocw.mit.edu 6.033 Computer System Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. L13: Sharing in network

More information

Congestion Control in Communication Networks

Congestion 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 information

Informatica Universiteit van Amsterdam. Distributed Load-Balancing of Network Flows using Multi-Path Routing. Kevin Ouwehand. September 20, 2015

Informatica Universiteit van Amsterdam. Distributed Load-Balancing of Network Flows using Multi-Path Routing. Kevin Ouwehand. September 20, 2015 Bachelor Informatica Informatica Universiteit van Amsterdam Distributed Load-Balancing of Network Flows using Multi-Path Routing Kevin Ouwehand September 20, 2015 Supervisor(s): Stavros Konstantaros, Benno

More information

STUDY OF SOCKET PROGRAMMING AND CLIENT SERVER MODEL

STUDY OF SOCKET PROGRAMMING AND CLIENT SERVER MODEL STUDY OF SOCKET PROGRAMMING AND CLIENT SERVER MODEL AIM: To conduct an experiment to demonstrate the working of file transfer with the UDP Server and Client. APPARATUS REQUIRED: PC with network simulation

More information

The War Between Mice and Elephants

The 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 information

Presentation_ID. 2002, Cisco Systems, Inc. All rights reserved.

Presentation_ID. 2002, Cisco Systems, Inc. All rights reserved. 1 Gigabit to the Desktop Session Number 2 Gigabit to the Desktop What we are seeing: Today s driver for Gigabit Ethernet to the Desktop is not a single application but the simultaneous use of multiple

More information

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) Fair Queueing

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay)  Fair Queueing Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Fair Queueing 2 Today Wireline Queue Drop Wireless Queue Drop 3 Types of Congestion Control Strategies

More information

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer

More information

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey

Fair Queueing. Presented by Brighten Godfrey. Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Fair Queueing Presented by Brighten Godfrey Slides thanks to Ion Stoica (UC Berkeley) with slight adaptation by Brighten Godfrey Traditional queueing Traditional Internet - Congestion control mechanisms

More information

Advanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler

Advanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler Advanced Lab in Computer Communications Meeting 6 QoS Instructor: Tom Mahler Motivation Internet provides only single class of best-effort service. Some applications can be elastic. Tolerate delays and

More information

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online 1 CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online Solutions 1. General Networking a. In traditional client-server communication using TCP, a new socket is created.

More information

RealMedia Streaming Performance on an IEEE b Wireless LAN

RealMedia Streaming Performance on an IEEE b Wireless LAN RealMedia Streaming Performance on an IEEE 802.11b Wireless LAN T. Huang and C. Williamson Proceedings of IASTED Wireless and Optical Communications (WOC) Conference Banff, AB, Canada, July 2002 Presented

More information

Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel

Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction In a packet-switched network, packets are buffered when they cannot be processed or transmitted at the rate they arrive. There are three main reasons that a router, with generic

More information

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes CS 4: COMPUTER NETWORKS SPRING 03 FINAL May 6, 03 50 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable justification.

More information

Sebastian Zander, Grenville Armitage. Centre for Advanced Internet Architectures (CAIA) Swinburne University of Technology

Sebastian Zander, Grenville Armitage. Centre for Advanced Internet Architectures (CAIA) Swinburne University of Technology TCP Experiment Automation Controlled Using Python (TEACUP) Sebastian Zander, Grenville Armitage Centre for Advanced Internet Architectures (CAIA) Swinburne University of Technology Overview TCP Experiments

More information

Chapter 4 Network Layer: The Data Plane

Chapter 4 Network Layer: The Data Plane Chapter 4 Network Layer: The Data Plane A note on the use of these Powerpoint slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see

More information

RMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN

RMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN RMIT University Data Communication and Net-Centric Computing COSC 1111/2061/1110 Medium Access Control Methods & LAN Technology Slide 1 Lecture Overview During this lecture, we will Look at several Multiple

More information

The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat

The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat BITAG TWG Boulder, CO February 27, 2013 Kathleen Nichols Van Jacobson Background The persistently full buffer problem, now called bufferbloat,

More information

CSCI Spring Final Exam Solution

CSCI Spring Final Exam Solution CSCI 4211 16Spring Final Exam Solution 1. When an IP packet arrives a router, how the router decides what is the next router (output link) this packet to be forwarded to? What are the routing table and

More information