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.

6.2. Discussion <strong>and</strong> Deployment Considerations of New-TCP Algorithms130<br />

A similar approach to H-TCP is taken with BicTCP, with almost zero<br />

increase in cwnd as it approaches its w target . FAST, however, with its design<br />

to stabilise the value of cwnd means that it is scalable with any buffer size.<br />

But, this only applies when it is stable. In order to reach equilibrium, the (upto)<br />

exponential increase in cwnd can cause serious implications for network<br />

traffic. Again, this increase is determined by the value of α in the utility<br />

function.<br />

One way of preventing large losses as a result of small buffer allocations is<br />

to utilise packet pacing [ASA00] whereby packets are not sent back-to-back<br />

but spread out over each RTT to prevent the large number of sequential packets<br />

drops due to drop-tail queuing mechanisms. However, findings in [ASA00]<br />

suggest that applying global TCP pacing would result in large amounts of<br />

TCP synchronisation due to the higher average queue occupancy of intermittent<br />

routers. Synchronisation occurs when flows competing along a link<br />

experience congestion at the same time, <strong>and</strong> as a result they all backoff together<br />

<strong>and</strong> ramp-up together. Depending on the backoff factor of the flows (as<br />

defined by H-TCP’s adaptive backoff factor), the link may be under-utilised<br />

as a result of synchronisation.<br />

The size of network queues is also important. As defined previously,<br />

network queues are necessary to buffer the increase in packets caused by<br />

the various algorithms’ increase parameters. Equation 5.6 states that for<br />

St<strong>and</strong>ard TCP, a queue provision equal to the b<strong>and</strong>width delay product is<br />

necessary for 100% utilisation. Indeed, this requirement is often stipulated<br />

in simulations involving network bulk transport [VS94]. However, [AKM04]<br />

states that the inclusion of such large amounts of buffer memory is not feasible<br />

due to physical size of Static RAM <strong>and</strong> the long latencies of DRAM.<br />

This problem raises concerns for fast long distance networks as the required

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

Saved successfully!

Ooh no, something went wrong!