On the Transition to a Low Latency TCP/IP Internet
|
|
- Easter Hicks
- 5 years ago
- Views:
Transcription
1 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, Parkville, Vic. 3010, Australia Abstract- Recently, a number of Active Queue Management (AQM) algorithms, such as REM and GREEN, have been proposed which reduce the packet queueing backlog and hence reduce the network s latency close to the propagation delay. This paper uncovers a fundamental problem that a low latency TCP/IP network faces. We call this problem the low latency efficiency collapse. With Explicit Congestion Notification (ECN) still not widely deployed, the main congestion notification remains packet dropping. By reducing the Round Trip Time (RTT) to near the propagation delay, TCP sessions become very aggressive and the packet dropping rate required for congestion notification becomes prohibitively high. In this paper, a solution to this problem is introduced. It is based on inducing latency. When applied to the new AQMs, it limits the packet loss whilst the Internet makes the transition to ECN. We demonstrate by an experiment that the proposed solution improves the efficiency by about 0%. 1. INTRODUCTION The total packet delay on the Internet is the sum of queuing delay (in routers and switches) and propagation delay (in physical medium). Currently due to poorly controlled queues, where Droptail and RED are deployed, queuing delay dominates most round trip times (RTT). A number of papers [1] [4] have envisioned a framework for a network where the network delay can be reduced to near the propagation delay. With a low latency Internet, there is no need for traffic class differentiation within the network (DiffServ) [1]. The framework proposed by [1], [4] and [6] achieve small queuing delays by controlling the congestion notification rate (packet marking or dropping) such that the effective price of bandwidth is controlled so that the arrival rate (consumption) is below the link s capacity (supply). The link price calculation is called the Active queue management (AQM) algorithm and the source algorithm follows a utility function that determines its consumption of bandwidth based on the bandwidth price. The most practicable deployment of this framework in the current Internet requires only the replacement of the AQM algorithm and must interoperate with the widely deployed TCP source algorithm. Another practical constraint is that the AQM must work with both methods of congestion notification: (1) explicit congestion notification (ECN) packet marking, and () packet dropping. Indeed operating with both constraints has been proposed by REM [4] and GREEN [6]. However, it is shown in this paper that deploying the unmodified REM and GREEN algorithms in the current network would result in what we call low latency efficiency collapse. The remainder of the paper is organised as follows. In Chapter we explain the problem of low latency efficiency collapse. In Chapter 3 we provide experimental results on a scenario involving small latency and demonstrate the efficiency collapse. In Chapter 4 the solution is presented.. INSIGHT INTO LOW LATENCY EFFICIENCY COLLAPSE To illustrate the problem faced by low latency AQMs with packet drop congestion notification, the simple and effective model for TCP proposed by S.Floyd [] is used. The maximum throughput of a TCP connection is bounded by the packet size B, round trip time R and packet loss rate p (congestion notification rate): 1.5 B T 3 R p Let us assume that the actual TCP throughput is some constant k times this upper bound. Then, the approximate TCP throughput is: (1) T = () R p
2 Now, the congestion notification rate p, ( 1 p 0 ) as a function of the R (RTT) and the desired throughput T is: p = (3) T R By (3), given an AQM algorithm that reduces the RTT, as R is reduced, the amount of packet dropping needed increases at rapidly increasing rate. This can be explained intuitively as follows. TCP increases its sending rate upon every positive acknowledgement. As the RTT reduces, these positive acknowledgements return at a faster rate causing TCP to increase its sending rate at a faster rate. As a result, in order for the AQM to maintain the same flow rate, with a smaller round trip time, more packet drops are necessary. In other words, decreased RTT permits a faster rate of positive acknowledgements. In order to control the rate, these must be compensated by a faster rate of negative acknowledgements, which must be signalled by dropping packets for non-ecn sources. As TCP retransmits the lost data, packet loss is not only a problem of losing the data but also loss of efficiency. The expected number of packet transmissions X needed for a successful transmission is given by 1 X =. (4) 1 p. EXPERIMENTAL RESULTS To study low latency efficiency collapse, an experiment was performed using a network of two computers running the LINUX operating system with TCP/SACK and no ECN as shown in Fig 1. The kernel version is On the source host the Kernel clock was increased from the default value of 100Hz to 1000Hz to improve measurement accuracy. The AQM used was GREEN [6], which is similar to REM in the sense that it produces just enough congestion notification to control the flow so that queuing is reduced, resulting in very low latencies. To emulate a range of RTT values, packets entering the AQM queue are time stamped, and not released until the delay time D has expired. Hence, RTT = D + ( propagation + queueing + processing delays) (7) The actual RTT was measured using the PING program executed at one-second intervals with over a hundred samples for each value of D. Fig. shows the relationship between D and RTT. Because the AQM queue service rate is the bottleneck in the system, D is a good estimator of the actual RTT. However, at small values of D, RTT does not go below 10 ms due to the scheduling latencies of both computers. Figure 1: AQM and Delay Test network By (4) X increases at an increasing rate as packet loss increases. The efficiency E is given by 1/X which, by (4), is E = 1 p. (5) TCP source host TCP AQM with variable delay 0.5 Mbps 100 Mbps TCP destination Host By combining (3) and (5), the efficiency E as a function of the RTT R is given by E = 1. (6) T R Note that the efficiency is highly sensitive to the RTT R. The fundamental result is that efficiency cannot be maintained as the latency is reduced for non-ecn sources (congestion notification by packet dropping). This is a fundamental problem in operating AQMs that aim to reduce queueing in an environment that includes non-ecn sources. This result gives a new fundamental reason for ECN. ECN will enable the operation of an efficient low latency TCP/IP network. Fig. 3 shows how the loss rate increases drastically as RTT is decreased to 0. Operating with no enforced delay creates a congestion notification drop rate of which results in about 79% throughput. This is a significant 1% loss of capacity. In reality, the situation is even more grave, as a drop rate of results in frequent TCP timeouts which pause transmission altogether. Indeed, with such a high drop rate, it was found that additional TCP sessions would sometimes not even start, as the handshaking packets were lost. Therefore, widespread deployment of low latency AQMs results in efficiency collapse for non-ecn sources.
3 Round Trip Time (ms) Figure : Round Trip Time (RTT) Vs AQM induced delay D Induced Delay D (ms) the RTT R. That is, the complete congestion feedback signal, or price, communicated to the source, is a function of the RTT R as well as of the congestion notification rate p. By () this price is: Pr ice = f ( R, p) = R p (9) The decrease in RTT R caused by the use of the REM like AQMs means that p must be increased to achieve the same price, leading to efficiency collapse when R is low. The throughput, interpreted as a utility function, should be: T = (10) Price Notice that this complete picture has the entire network feedback signal in the price (k and B are independent of the network). 4. SOLUTION TO EFFICIENCY COLLAPSE PROBLEM Packet drop rate (due to congestion notification only ) Figure 3: Congestion Notification Packet Dropping Rate Vs RTT Round Trip Time (ms) In literature [7] [8] [9], congestion control analysis has been performed on the basis that the round trip time is a constant. Unfortunately this hides the low latency efficiency collapse. We have demonstrated that it is not enough to only considered the packet-marking rate or dropping rate as a signal of congestion to TCP. In fact, the complete congestion signal that affects TCP also includes In a real network, low latencies will exist in a number of situations: (a) With complete deployment of REM or GREEN across each link on the route. (b) If the network contains other AQMs (RED, Droptail etc) and it is not bottlenecked at the RED or Droptail links. In all of these situations the efficiency collapse problem will manifest itself because the total RTT is low. In previous sections, we discussed the relationship between RTT and the required packet dropping for non-ecn sources and showed that an increased RTT results in a lower packet-dropping rate. Therefore, one solution to reducing the packet dropping is to induce a fixed packet delay to increase the RTT. Since by (7), the minimum RTT time is bounded by the induced delay D, by (3), the loss is bounded to some desired maximum loss l d.. In this case, the D value required to satisfy the maximum bound of l d, for a TCP flow with throughput T bps can be obtained from () to approximated by: D =. (11) T l d Since the source and destination are not known in advance, it is not possible to distribute this enforced delay across the links of the network so that each source and destination receives the minimum possible delay. In this case, a
4 conservative policy is to enforce the minimum delay at each router. As the minimum delay necessary for reasonable loss figures is in the order of 30 ms for the tested case, this is a good compromise. Figure 3: AQM with controlled delay TS unit: Time stamp Pkt stamp = NOW AQM Figure 4: Notification Signal Splitter ECN? Y N AQM AQM and delay C e C d If NOW < (stamp + D) Requeue Pkt at head Else Transmit Pkt Ironically, the pre-rem like AQM algorithms such as Droptail and RED do not have to introduce the induced latency D because of their own poor queueing performance (large backlog) [6]. This backlog always ensures that the minimal required latency is satisfied. The REM and GREEN like algorithms can deliver lower latency then a path with Droptail or RED as only the minimum delay is induced. The enforced delay D at each queue can be implemented by setting a time-stamp (of value stamp) on the arriving packet with stamp = current time, and not dequeuing the packet until the current time passes D + stamp, as shown in Fig 3. The unfortunate consequence of enforcing the minimum delay D is that ECN enabled flows, which can successfully operate with low latencies, must also suffer the enforced delay. The ideal case, would be to have all sources ECN enabled, and not require the enforced delay D at all. However, the Internet will continue to have a mixture of ECN and non-ecn TCP sources. If the REM/GREEN like AQMs were deployed without the enforced delay, the low latencies and resulting high congestion notification rate would cause a grossly unfair allocation of bandwidth to C ECN enabled flows, as non-ecn flows would suffer many timeouts and retransmission inefficiencies. To solve this problem a new component is introduced, the Notification Signal Splitter, Fig 4. This element maintains a separate queue for ECN enabled packets and non-ecn enabled packets. When the packet arrives, the packet is sent to the appropriate queue based on the ECN Capable Transport (ECT) bit in the IP header. Each queue is controlled by a separate instance of the AQM algorithm. The non-ecn queue induces the minimum delay D on the packets routed through it, and the ECN queue does not have any induced delay. Let us assume that the capacity of the link is C, and the capacities of the ECN and the non-ecn queues are C e and C d, respectively. Then the following must be satisfied: C = C e + C d. (1) If one wishes to apportion the capacity fairly between ECN and non-ecn flows, C e and C d are set proportionally to the number of ECN N e and non-ecn N d sources, respectively, as follow: Ne Ce = C (13) Nd + Ne and Nd Cd = C. (14) N + N d Determining the number of ECN and non-ecn sources requires per-flow information. However, this does not need to be done in real-time, nor does it have to be very accurate. A passive monitoring program can estimate the proportion of ECN and non-ecn sources on, say a monthly basis, and determine the required split. As the Internet migrates to ECN, C e will increase. It is recommended that in fact, ECN sources be given more than their fair share of capacity, to provide extra incentive to migrate, in addition to the low latency. The technique can be further extended by combining the two queues into one, and inducing delay only on non-ecn TCP packets. All other packets, such as ECN TCP, UDP and ICMP packets are forwarded with no induced latency. For each type of packet, ECN TCP, non-ecn TCP, UDP etc, the packet congestion-marking rate can be scaled by a factor which determines that packet s share of the service rate in a fully loaded system. In this way, if ECN TCP packets don t use their share of capacity, other packets can use this capacity. Packet identification is performed by reading the IP header. This extension is a topic of future work. e
5 5. CONCLUSION This paper has uncovered a significant performance issue in migrating to a low latency Internet. The techniques presented prevent the efficiency collapse that would occur if latencies were brought near the propagation delay. A framework for the transition from packet dropping to ECN has been presented which makes possible the benefits of low latency AQMs without the efficiency collapse problem. ACKNOWLEDGEMENTS This work was financially supported by Agilent Technologies. REFERENCES [1] F. Kelly, "Models for a self-managed Internet", Philosophical Transactions of the Royal Society A358, 000, pp [] S. Floyd and K. Fall. Router mechanisms to support end-to-end congestion control, February 1997, LBL Technical Report. [3] S. Floyd and V. Jacobson Random early detection gateways for congestion avoidance IEEE/ACM Transactions on Networking, vol. 1, number 4, August 1993, pp [4] S. Athuraliya and S.H. Low. "Optimization Flow Control, II: Random Exponential Marking", Submitted for publication, May 000. [5] W. Feng, D. Kandlur, D. Saha and K. Shin, "Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness", in Proc. of INFOCOM 001, April 001. [6] B. Wydrowski and M. Zukerman, GREEN: An Active Queue Management Algorithm, 001, (submitted for publication, available: [7] T.V. Lakshman and Upmanyu Madhow, The performance of TCP/IP for networks with high bandwidth-delay products and random loss, IEEE/ACM Transactions of Networking, vol. 5, number 3, pp , June [8] Matthew Mathis, Jeffrey Semke, Jamshid Mahdavi, and Teunis Ott The macroscopic behaviour of the TCP congestion avoidance algorithm, ACM Computer Communications Review, vol. 7, number 3, July [9] S. H. Low, A Duality Model of TCP and Queue Management Algorithms, Proceedings of ITC Specialist Seminar on IP Traffic Measurement, Modeling and Management, September 18-0, 000, Monterey, CA (USA)
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 informationBuffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification. Chunlei Liu Raj Jain
Buffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification Chunlei Liu Raj Jain Department of Computer and Information Science The Ohio State University, Columbus, OH 432-277
More informationAnalyzing 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 informationTraffic Management using Multilevel Explicit Congestion Notification
Traffic Management using Multilevel Explicit Congestion Notification Arjan Durresi, Mukundan Sridharan, Chunlei Liu, Mukul Goyal Department of Computer and Information Science The Ohio State University
More informationA Modification to RED AQM for CIOQ Switches
A Modification to RED AQM for CIOQ Switches Jay Kumar Sundararajan, Fang Zhao, Pamela Youssef-Massaad, Muriel Médard {jaykumar, zhaof, pmassaad, medard}@mit.edu Laboratory for Information and Decision
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 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 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 informationRandom 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 informationRECHOKe: A Scheme for Detection, Control and Punishment of Malicious Flows in IP Networks
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < : A Scheme for Detection, Control and Punishment of Malicious Flows in IP Networks Visvasuresh Victor Govindaswamy,
More informationRouter participation in Congestion Control. Techniques Random Early Detection Explicit Congestion Notification
Router participation in Congestion Control 1 Techniques Random Early Detection Explicit Congestion Notification 68 2 Early congestion notifications Early notifications inform end-systems that the network
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 informationXCP: 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 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 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 informationStudying Fairness of TCP Variants and UDP Traffic
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
More informationOn the Deployment of AQM Algorithms in the Internet
On the Deployment of AQM Algorithms in the Internet PAWEL MROZOWSKI and ANDRZEJ CHYDZINSKI Silesian University of Technology Institute of Computer Sciences Akademicka 16, Gliwice POLAND pmrozo@go2.pl andrzej.chydzinski@polsl.pl
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 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 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 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 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 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 informationStateless Proportional Bandwidth Allocation
Stateless Proportional Bandwidth Allocation Prasanna K. Jagannathan *a, Arjan Durresi *a, Raj Jain **b a Computer and Information Science Department, The Ohio State University b Nayna Networks, Inc. ABSTRACT
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 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 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 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 informationCPSC 826 Internetworking. Congestion Control Approaches Outline. Router-Based Congestion Control Approaches. Router-Based Approaches Papers
1 CPSC 826 Internetworking Router-Based Congestion Control Approaches Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu October 25, 2004 http://www.cs.clemson.edu/~mweigle/courses/cpsc826
More informationAn Adaptive Neuron AQM for a Stable Internet
An Adaptive Neuron AQM for a Stable Internet Jinsheng Sun and Moshe Zukerman The ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering,
More informationMarkov 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 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 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 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 informationA Framework For Managing Emergent Transmissions In IP Networks
A Framework For Managing Emergent Transmissions In IP Networks Yen-Hung Hu Department of Computer Science Hampton University Hampton, Virginia 23668 Email: yenhung.hu@hamptonu.edu Robert Willis Department
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 informationDifferential Congestion Notification: Taming the Elephants
Differential Congestion Notification: Taming the Elephants Long Le, Jay Kikat, Kevin Jeffay, and Don Smith Department of Computer science University of North Carolina at Chapel Hill http://www.cs.unc.edu/research/dirt
More informationA Note on the Stability Requirements of Adaptive Virtual Queue
A ote on the Stability Requirements of Adaptive Virtual Queue Dina Katabi MIT-LCS dk@mit.edu Charles Blake MIT-LCS cb@mit.edu Abstract Choosing the correct values for the parameters of an Active Queue
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 informationComputer Networking. Queue Management and Quality of Service (QOS)
Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you
More informationTuning 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 informationTCP-Peach and FACK/SACK Options: Putting The Pieces Together
TCP-Peach and FACK/SACK Options: Putting The Pieces Together Giacomo Morabito, Renato Narcisi, Sergio Palazzo, Antonio Pantò Dipartimento di Ingegneria Informatica e delle Telecomunicazioni University
More informationCore-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica CMU Scott Shenker Xerox PARC Hui Zhang CMU Congestion Control in Today s Internet Rely
More informationIncrementally Deployable Prevention to TCP Attack with Misbehaving Receivers
Incrementally Deployable Prevention to TCP Attack with Misbehaving Receivers Kun Gao and Chengwen Chris Wang kgao, chengwen @cs.cmu.edu Computer Science Department Carnegie Mellon University December 15,
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 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 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 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 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 informationImproving TCP Performance over Wireless Networks using Loss Predictors
Improving TCP Performance over Wireless Networks using Loss Predictors Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano P.zza L. Da Vinci 32, 20133 Milano Email: martignon@elet.polimi.it
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 informationTransport Protocols for Data Center Communication. Evisa Tsolakou Supervisor: Prof. Jörg Ott Advisor: Lect. Pasi Sarolahti
Transport Protocols for Data Center Communication Evisa Tsolakou Supervisor: Prof. Jörg Ott Advisor: Lect. Pasi Sarolahti Contents Motivation and Objectives Methodology Data Centers and Data Center Networks
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 informationCS 356: Computer Network Architectures Lecture 19: Congestion Avoidance Chap. 6.4 and related papers. Xiaowei Yang
CS 356: Computer Network Architectures Lecture 19: Congestion Avoidance Chap. 6.4 and related papers Xiaowei Yang xwy@cs.duke.edu Overview More on TCP congestion control Theory Macroscopic behavior TCP
More informationImproving Internet Congestion Control and Queue Management Algorithms. Wu-chang Feng March 17, 1999 Final Oral Examination
Improving Internet Congestion Control and Queue Management Algorithms Wu-chang Feng March 17, 1999 Final Oral Examination Outline Motivation Congestion control and queue management today (TCP, Drop-tail,
More informationTechniques in Internet Congestion Control
Techniques in Internet Congestion Control 1 Bartek Peter Wydrowski Submitted for examination for the fulfilment of the degree of Doctor of Philosophy February 2003 Electrical and Electronic Engineering
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 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 information! Network bandwidth shared by all users! Given routing, how to allocate bandwidth. " efficiency " fairness " stability. !
Motivation Network Congestion Control EL 933, Class10 Yong Liu 11/22/2005! Network bandwidth shared by all users! Given routing, how to allocate bandwidth efficiency fairness stability! Challenges distributed/selfish/uncooperative
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 informationTCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS
TCP PERFORMANCE FOR FUTURE IP-BASED WIRELESS NETWORKS Deddy Chandra and Richard J. Harris School of Electrical and Computer System Engineering Royal Melbourne Institute of Technology Melbourne, Australia
More informationSplitBuff: Improving the Interaction of Heterogeneous RTT Flows on the Internet
SplitBuff: Improving the Interaction of Heterogeneous RTT Flows on the Internet Shahida Jabeen, Muhammad Bilal Zafar, Ihsan Ayyub Qazi, Zartash Afzal Uzmi Computer Science Department, LUMS Email: {shahida.jabeen,26,ihsan.qazi,zartash}@lums.edu.pk
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 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 information15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers
TCP & Routers 15-744: Computer Networking RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay Product Networks L-6
More informationA New Fair Window Algorithm for ECN Capable TCP (New-ECN)
A New Fair Window Algorithm for ECN Capable TCP (New-ECN) Tilo Hamann Department of Digital Communication Systems Technical University of Hamburg-Harburg Hamburg, Germany t.hamann@tu-harburg.de Jean Walrand
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
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 informationETSF10 Internet Protocols Transport Layer Protocols
ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.1 Kaan Bür, Jens Andersson Transport Layer Protocols Process-to-process delivery [ed.4 ch.23.1] [ed.5 ch.24.1] Transmission Control
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE 333: Introduction to Communication Networks Fall 2001 Lecture 28: Transport Layer III Congestion control (TCP) 1 In the last lecture we introduced the topics of flow control and congestion control.
More informationNetwork Model for Delay-Sensitive Traffic
Traffic Scheduling Network Model for Delay-Sensitive Traffic Source Switch Switch Destination Flow Shaper Policer (optional) Scheduler + optional shaper Policer (optional) Scheduler + optional shaper cfla.
More informationThe Present and Future of Congestion Control. Mark Handley
The Present and Future of Congestion Control Mark Handley Outline Purpose of congestion control The Present: TCP s congestion control algorithm (AIMD) TCP-friendly congestion control for multimedia Datagram
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 informationStabilizing RED using a Fuzzy Controller
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 27 proceedings. Stabilizing RED using a Fuzzy Controller Jinsheng
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 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 informationRequest for Comments: S. Floyd ICSI K. Ramakrishnan AT&T Labs Research June 2009
Network Working Group Request for Comments: 5562 Category: Experimental A. Kuzmanovic A. Mondal Northwestern University S. Floyd ICSI K. Ramakrishnan AT&T Labs Research June 2009 Adding Explicit Congestion
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 informationCongestion Avoidance Using Adaptive Random Marking
Congestion Avoidance Using Adaptive Random Marking Marissa Borrego, Na Li, Gustavo de Veciana, San-qi Li Department of Electrical and Computer Engineering University of Texas at Austin Austin, Texas (marissa,
More informationCS 268: Computer Networking
CS 268: Computer Networking L-6 Router Congestion Control TCP & Routers RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay
More informationFlow and Congestion Control
CE443 Computer Networks Flow and Congestion Control Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought
More informationMaster s Thesis. TCP Congestion Control Mechanisms for Achieving Predictable Throughput
Master s Thesis Title TCP Congestion Control Mechanisms for Achieving Predictable Throughput Supervisor Prof. Hirotaka Nakano Author Kana Yamanegi February 14th, 2007 Department of Information Networking
More informationPromoting the Use of End-to-End Congestion Control in the Internet
Promoting the Use of End-to-End Congestion Control in the Internet IEEE/ACM Transactions on ing, May 3 1999 Sally Floyd, Kevin Fall Presenter: Yixin Hua 1 About Winner of the Communications Society William
More informationDelay Performance of the New Explicit Loss Notification TCP Technique for Wireless Networks
Delay Performance of the New Explicit Loss Notification TCP Technique for Wireless Networks Wenqing Ding and Abbas Jamalipour School of Electrical and Information Engineering The University of Sydney Sydney
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 informationA Proposal to add Explicit Congestion Notification (ECN) to IPv6 and to TCP
A Proposal to add Explicit Congestion Notification (ECN) to IPv6 and to TCP K. K. Ramakrishnan, Sally Floyd References: Ramakrishnan, K.K., and Floyd, S., A Proposal to add Explicit Congestion Notification
More informationCommunications Software. CSE 123b. CSE 123b. Spring Lecture 3: Reliable Communications. Stefan Savage. Some slides couresty David Wetherall
CSE 123b CSE 123b Communications Software Spring 2002 Lecture 3: Reliable Communications Stefan Savage Some slides couresty David Wetherall Administrativa Home page is up and working http://www-cse.ucsd.edu/classes/sp02/cse123b/
More informationCongestion Avoidance
Congestion Avoidance Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks References K. K. Ramakrishnan, Raj Jain, A Binary Feedback Scheme for Congestion
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 informationCongestion / Flow Control in TCP
Congestion and Flow Control in 1 Flow Control and Congestion Control Flow control Sender avoids overflow of receiver buffer Congestion control All senders avoid overflow of intermediate network buffers
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 informationActivity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks
Communication Networks Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks Michael Menth and Nikolas Zeitler http://kn.inf.uni-tuebingen.de Outline The problem Definition
More informationThree-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 informationINTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 A SURVEY ON EXPLICIT FEEDBACK BASED CONGESTION CONTROL PROTOCOLS Nasim Ghasemi 1, Shahram Jamali 2 1 Department of
More informationPromoting the Use of End-to-End Congestion Control in the Internet
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE/ACM Transactions on Networking May 1999 ACN: TCP Friendly 1 Outline The problem of Unresponsive Flows
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 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 informationPerformance Evaluation of Controlling High Bandwidth Flows by RED-PD
Performance Evaluation of Controlling High Bandwidth Flows by RED-PD Osama Ahmed Bashir Md Asri Ngadi Universiti Teknology Malaysia (UTM) Yahia Abdalla Mohamed Mohamed Awad ABSTRACT This paper proposed
More informationTHE TCP specification that specifies the first original
1 Median Filtering Simulation of Bursty Traffic Auc Fai Chan, John Leis Faculty of Engineering and Surveying University of Southern Queensland Toowoomba Queensland 4350 Abstract The estimation of Retransmission
More informationAn Enhanced Slow-Start Mechanism for TCP Vegas
An Enhanced Slow-Start Mechanism for TCP Vegas Cheng-Yuan Ho a, Yi-Cheng Chan b, and Yaw-Chung Chen a a Department of Computer Science and Information Engineering National Chiao Tung University b Department
More information