spaper19_slides - TCP Smoothness and Windows Adjustment...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
TCP Smoothness and Windows Adjustment Strategy Authors: Chi Zang and Vassilis Tsaoussidis By: Nishanth Singh Gurung. Srihari Narayanan.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Outline Introduction Discussion on TCP Smoothness An experiment protocol Experiment and Analysis Conclusion
Background image of page 2
Introduction • It is observed that when system‟s throughput is relatively stable, the end users using the media streaming applications need not experience smooth throughput, because of unsynchronized windows adjustments due to random congestion occurrence. • In this paper the author: 1. Analyzes and evaluates the negative impact of random window adjustments on smoothness, long term and short term fairness. 2. The author explains an experimental congestion avoidance mechanism, namely TCP(α, β, γ, δ), based on coordinated window adjustments.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Outline Introduction Discussion on TCP Smoothness An experiment protocol Experiment and Analysis Conclusion
Background image of page 4
Dynamics of Congestion control
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Dynamics of Congestion control • n TCP flows share a bottleneck link with a capacity of „bw‟. • RTT = 2 * (src_delay + delay + sink_delay). • For the overall system behavior, the aggregate congestion window at time t is given as
Background image of page 6
• System throughput is given by: • Thus the throughput is not only the function of congestion window, but also dynamic queuing delay.
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
• Assuming the flows to be additive increase stage, if scwnd(t) is below the point knee: • There is no queue build (i.e. . RTT(t)= RTT 0 ), but there could be temporary build up due to traffic burstiness. • Throughput increases with scwnd, since the system‟s bottleneck capacity is not fully utilized until scwnd increases to scwnd knee
Background image of page 8
• If system congestion increases beyond scwnd knee , the system displays different dynamics. • The bottleneck queue starts to build up, after the bottleneck capacity is saturated. • scwnd can be represented as below: • Steady queuing delay would be:
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
• The system throughput is bounded by the physical capacity bw, inspite of increase of scwnd(t) beyond the knee, because qdelay(t) at the denominator increases as well. • The system dynamics can be continuously
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 37

spaper19_slides - TCP Smoothness and Windows Adjustment...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online