05.08.2014 Views

An Investigation into Transport Protocols and Data Transport ...

An Investigation into Transport Protocols and Data Transport ...

An Investigation into Transport Protocols and Data Transport ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5.4. <strong>An</strong>alysis of AIMD Congestion Control 102<br />

For example, in real life systems, a packet loss rate of about 10 −7 is<br />

comparable to the r<strong>and</strong>om losses that occur in long haul fibres, routers,<br />

switches <strong>and</strong> end-systems. This physical limit imposes an absolute limit<br />

on the throughput that a TCP connection can achieve - even without<br />

competing traffic on the end-to-end path (see Section 5.4.2).<br />

B<strong>and</strong>width The higher throughput that the TCP connection has to sustain,<br />

the larger its cwnd for the connection. With the implementation of the<br />

current Additive Increase of 1 segment per round-trip time, TCP probes<br />

for extra network capacity slowly, <strong>and</strong> therefore is unable to effectively<br />

use available network resources that are present on high b<strong>and</strong>width<br />

networks that are not fully utilised.<br />

Also, the detection of packet loss through congestion or network corruption<br />

in TCP results in a halving of its cwnd. When high speeds are<br />

reached this mechanism of Multiplicative Decrease by half leads to a<br />

significant decrease in the throughput of the TCP connection.<br />

As TCP congestion control is cyclic (i.e. it will continue to slowly<br />

increase its sending rate until congestion/loss is detected, where upon<br />

it will halve the rate) the overall utilisation of the link by a single TCP<br />

flow could be low compared to the capacity of the bottleneck link on<br />

the path.<br />

Round-Trip Time TCP utilises acknowledgments to update its window<br />

based algorithms. This provides a feedback loop that drives the linear<br />

increase of cwnd to increase its throughput. As the round-trip latency<br />

increases, the time required for this feedback also increases. This results<br />

in a slower rate of increase (in absolute time) of cwnd <strong>and</strong> therefore a

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!