Download presentation

Presentation is loading. Please wait.

Published byEric Garcia Modified over 3 years ago

1
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication Research Group wwwtlc.iet.unipi.it Michele Pagano and Raffaello Secchi A Survey on TCP Performance Evaluation and Modeling

2
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 2 Outline Fast overview on TCP congestion control mechanisms Models of TCP congestion control A simple stationary models The long-term TCP bandwidth TCP in high bandwidth-delay product networks TCP interactions with AQM Tuning RED parameters through linear control theory

3
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 3 TCP congestion control algorithm ReceiverSender ReceiverSender Key parameters cwnd ssthresh Additive-Increase Multiplicative Decrease TCP increases its cwnd by roughly one MSS every RTT as long as no loss event occurs (linear increase phase or congestion avoidance) Slow Start TCP increases its rate exponentially fast by doubling its value of cwnd every RTT Reaction to loss events (triple duplicate ACKs) Fast Retransmit Fast Recovery

4
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 4 Evolution of TCPs Congestion Window ssthresh = 8 cwnd = 16 Loss detected by a timeout Loss detected by a triple DupACK cwnd = 14 ssthresh = 7 TCP Reno vs. TCP Tahoe

5
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 5 Models of TCP congestion control Single connection models –Assume the knowledge of network characteristics, such as mean RTT and loss probability, and try to evaluate the performance of TCP connections –This class can be further divided into models for short-lived and long-lived connections Models of interaction with AQM –Derive the performance of TCP and network statistics –Introduce a sub-model of TCP and a sub-model of IP network protocol and solves through fixed-point procedures Models for TCP Network Optimization –Interpret the steady-state behaviour of TCP sources as the solution of a large optimization problem –An utility function is associated to each source. The aggregate of TCP sources converges toward a global optimality point

6
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 6 Single source traffic models Underlying assumptions: Steady state The loss rate and RTT are independent from the source No ACK loss Neglect the slow-start phase TCP-Reno model: Congestion Avoidance Fast Retransmit – Fast Recovery Delayed-ACK

7
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 7 W(t) W max /2 W max Loss Probability periodic behaviour of congestion window Total packets per cycle b · W max /2 b · W max time (RTT) Throughput Maximum cwnd Simple stationary model

8
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 8 The previous expression does not take into account the timeout mechanisms It is an optimistic estimate of the bandwidth of a TCP connection. –It is accurate in the range of small loss probabilities –It is not suitable to determine performance of TCP over slow-speed line (few packets in transit) Simple stationary model

9
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 9 TCP window size evolution W(t) t n i cycles with Additive Increase (cwnd-cycles) Ends of Congestion Avoidance phase (timeout mechanism) Timeout period New TCP cycle A cj T cj

10
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 10 Throughput estimation Mean duration of a cwnd-cycle period Probability that congestion is detected by timeout Mean duration of a timeout period Amount of data delivered in a cwnd-cycle period

11
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 11 Modeling timeout T 0 is the initial value of the timeout period For each unsuccessful retransmission (which happens with probability p) the timeout period is doubled until a threshold value (64T 0 ) is reached The retransmit timeout remains constant after 64T 0 Exponential Backoff T0T0 2T 0 4T 0 loss Mean duration of a timeout period loss t

12
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 12 Fast Retransmit / Fast Recovery w t W(t) A period of congestion window increasing The losses in consecutive RTT are independent The losses of packets within the same round are correlated since DropTail discipline induces a bursty dropping behaviour A packet is lost with probability p given that the previous was not lost All the packets following the first packet lost in a round of packet transmission would be also lost. w

13
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 13 Probability of timeout Probability of having k

14
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 14 Probability of timeout A good numerical approximation of the conditional timeout probability is the limit as p0 of expression of Q: This expression is based on the assumption that, when p0, all packets in a particular round are equally liked to be dropped, with at most one drop per round. In that case, any one of last 3 packets in a round can cause a timeout if dropped Finally, the probability of timeout is computed as a function of the mean size of congestion window E[W].

15
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 15 Model validation From [PFTK] Additional term related to the impact of the window limitation

16
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 16 TCP in high bandwidth-delay product networks The goal of TCP is to keep outstanding an amount of data equal to the bandwidth-delay product of path. Over WANs TCP experiences a round trip delay of the same order of magnitude of buffering delay. Keep the pipe full can be difficult if TCP suffers occasional random losses due to: –transient congestion –lossy link (wireless) –link sharing with uncontrolled load (real-time traffic) Performance of TCP-Reno with respect to … –WAN delay-bandwidth product –rate of random losses

17
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 17 The case loss-free path (fluid model) When the size of window exceeds Wmax a buffer overflow occurs and the cwnd is set to Wmax /2 The cwnd-evolution is governed by following equation The ACK reception rate is equal to the link rate c if the bottleneck is congested, otherwise it is equal to the sending rate W/T The total latency of the path is the sum of transmission delay and propagation delay TCP B c TCP bottleneck link

18
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 18 The case loss-free path W(t) time The queue is filling up loss epoch The first sub-period of congestion avoidance pipesize capacity linear increase The second sub-period of congestion avoidance

19
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 19 The case loss-free path The performance of TCP can be expressed as a function of the ratio between the bottleneck buffer size and pipe size –TCP suffers the presence of small buffers –Larger buffers determine an increase of delays –To fully exploit the capacity of bottleneck the buffer should be at least equal to pipe size The mean throughput of TCP-Reno is then given by:

20
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 20 Random loss scenario A packet, successfully delivered at the bottleneck link, can be lost randomly with probability q. The evolution of congestion window is determined by the window size w at the beginning of cwnd-cycle (Markov process) We introduces two functions: random loss Window size after n successful packet transmissions (w initial window) Time required to complete n successful packet transmissions TCP B c q TCP bottleneck link

21
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 21 Markov chain analysis 0 … 1 w i -1wiwi … w i +1 2w i -1 … … N w (w i ) 0 … 1 w i -1 … 0 … 1 … Since the independent loss model used … The cwnd evolution is expressed through these recursive equations Once solved the time-homogenous Markov chain, we can evaluate the throughput ……

22
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 22 General comments This analysis can be extended also to other versions of TCP Since the analysis is computational expensive, approximated solutions have been proposed (see [LM97]). Even small loss leads to a significant throughput deterioration over networks with high bandwidth-delay products. TCP performance is strongly dependent on the parameter q(cT) 2 and decreases sharply as this parameter increases –too early drops in the TCP cycle induce the over-reaction Random losses should be avoided –flow isolation –link layer protocols

23
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 23 Interaction between TCP and AQM Fluid model: –The congestion window is a continuous variable –A continuous flow of data Interaction between TCP-Reno and AQM mechanism Fixed-Point approach TCP Network load p loss RTT

24
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 24 RED (Random Early Detection): implicit congestion avoidance mechanism RED discards packets randomly in order to: –Prevent the incipient congestion by reacting earlier –Avoid the synchronization between sources –Mechanism of Dropping/Marking based on the mean queue length –Moving Average Algorithm used to smooth the instantaneous queue size x p(x) 1 T max T min P max Mean queue size Probability of Dropping Active Queue Management: RED

25
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 25 Active Queue Management: RED Moving average filter Sampled data system t x(t) Instantaneous queue length Mean queue length

26
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 26 Model of the network The network is modelled as a set of L links with capacities c l l = 1,2, …, L and the links are shared by a set of S sources indexed by s = 1,2, …, S each using a subset L s of links Basic quantities routing matrix congestion window associated with each TCP source probability of drop and instantaneous length associated with each link

27
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 27 Model of the network Parameters related to the s-th TCP connection Round trip time End-to-end dropping probability s is the round trip propagation delay since we are considering AQM/RED, we may reasonably assume that drops at different queue are independent

28
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 28 Model of the network Differential version of the Lyndley equation Mean transient behaviour (by approximating the expectation of both sides): Parameters related to dynamic of the l-th queue Incoming traffic Outgoing traffic

29
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 29 Model of the source t W(t) loss events Additive Increase Multiplicative Decrease Again, taking the expectation Packet losses at flow s are modelled by a Poisson process with time varying rate Ni(t): number of losses suffered by flow i t: point of time when the flow detects losses Evolution of cwnd:

30
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 30 Model of the source In proportional marking schemes the dropping rate is proportional to the share of the connection expected value for drop rate at link l L s Actually, drops occur at the node about a round trip time before they can detected by the sender (the latency of feedback is important in a control system since it impacts on stability) This equation governs the evolution of congestion window of s-th connection

31
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 31 Stochastic differential equations system 2L+S coupled equations in the unknowns (x,q,W) that can be solved numerically The time needed to solve the system is several order of magnitude less than that needed for the simulation of the same network scenario TCP RED Lindley

32
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 32 Linearized analysis of TCP with AQM Goal: linearization of the previous set of equations in the case of single bottleneck link topology The linearized system is suitable to be studied through the classic tools of linear control theory. The linear analysis gives us many suggestions on the way to modify the algorithm in order to achieve stability and robustness BOTTLENECK losses

33
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 33 Linear analysis: the single link case Let us consider N identical TCP Reno flows (with the same RTT) sharing a common link with capacity C. We have assumed that the server is always transmitting packets (bottleneck) Common value of RTT:

34
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 34 Block diagram + X X LOW PASS + TCP RED Congested Router - controller

35
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 35 Small signal analysis Goals of an AQM (RED) controller Stable closed-loop system Acceptable transient response Insensitivity to variations of model parameters Insensitivity to disturbance factors (short lived flows) Strategy Linearization around the operating point (W 0, q 0, p 0 ) Input: Loss probability Output: Queue size Design of RED using dominant pole compensation

36
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 36 Small signal analysis Operating point derivative equal to zero: Difference variables linearization in a neighbourhood of the operating point

37
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 37 Laplace representation The static gain of plant is proportional to RTT and capacity inversely proportional to the number of active flows A small number of TCP flows lead to an oscillatory response An increase in the round trip time reduces the controllability of the system High speed links are difficult to control Representation of the system in the Laplace domain:

38
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 38 Small signal model controller gain RED acts as a proportional controller controller time-constant Internet routers typically implement a drop tail policy in the queues (ON-OFF control strategy) strong oscillation in queue size, with the alternation of emptiness and buffer overflow RED should reduce the extent of variations in queue length Trade-off between acceptable queuing delay and link utilization. + + -

39
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 39 RED Design In choosing the parameters of RED controller (K,β), it is necessary to introduce some bounds on the number of TCP sessions and on RTT: Basic Result: Under previous constraints, if K and β satisfy the following condition: the system converges exponentially fast to the equilibrium, for whatever initial condition. where dominant pole compensation

40
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 40 Designing AQM/RED Bode Plots Amplitude Phase -90 0 -180 0 phase margin Usually the dynamics of the queue are faster than those of TCP

41
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 41 Conclusions Summary of analytical modelling for the performance evaluation of Internet congestion control Bandwidth achieved by a TCP connection in response to network conditions –These models are also useful in asymptotic conditions with many sources Interaction between TCP and AQM (RED) schemes –Qualitative understanding of TCP transient behaviour. –Powerful tools of linear control theory –Selection of the network parameters leading to stable and robust working conditions

42
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 42 A few references [PFTK98] J. Padhye, V. Firoiu, D. Towsley and J. Kurose, Modeling TCP Throughput: A Simple Model and its Empirical Validation, In SIGCOMM, 1998. [LM97] T. Lackshman and U. Madhow, The performance of TCP/IP for networks with high bandwidth-delay products and random loss, In Transaction on Networking, 1997 [VGT99] V. Misra, W. Gong, D. Towsley, Stochastic Differential Equation Modeling And Analysis of TCP-Windowsize Behavior, In PERFORMANCE, Istanbul, Turkey, 1999. [HMTG01] C. Hollot, V. Misra, D. Towsley and W. Gong. A Control Theoretic Analysis of RED, In INFOCOMM 2001

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google