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 Algorithms132<br />

algorithms should be friendly. It implements the idea that upon congestion<br />

the H-TCP flow should always revert back to St<strong>and</strong>ard TCP <strong>and</strong> hence maintain<br />

at least temporary fairness with St<strong>and</strong>ard TCP. Only after a period of<br />

time, after congestion, should the high speed mode be applied.<br />

However, the balance between being able to co-exist with legacy traffic,<br />

<strong>and</strong> being able to achieve high throughput seems difficult. On one h<strong>and</strong>, it is<br />

a necessity to increase the aggressiveness of the congestion control algorithm<br />

in order to utilise spare b<strong>and</strong>width. On the other h<strong>and</strong>, this potentially<br />

means starving less aggressive flows of network resources.<br />

This also applies to flows of the same algorithm as it is unlikely that<br />

two flows on the Internet sharing a bottleneck will also have the same endto-end<br />

latency. Therefore, a question arises over how fair these algorithms<br />

are in sharing b<strong>and</strong>width when competing flows have different end-to-end<br />

latencies. The problem of this RTT unfairness stems from the fact that low<br />

latency flows are more responsive, <strong>and</strong> hence more aggressive, than flows on<br />

longer latency links. Therefore, it is possible that the flows on a low latency<br />

path completely starve the less responsive flow of throughput.<br />

H-TCP implements a ‘RTT scaling’ function in order to maintain fairness<br />

between competing flows of different RTT’s. This is implemented by altering<br />

the value of its increase parameter α such that it is scaled by the ratio of the<br />

experienced minimum latency <strong>and</strong> the average latency for a flow [LS04b].<br />

It is also possible to help impose fairness between flows using AQM (See<br />

Section 5.3.2). Using RED, for example, would drop a higher proportion of<br />

packets from a more intensive flow; <strong>and</strong> therefore reduce its throughput <strong>and</strong><br />

equalise fairness [Has89]. This also has the beneficial effect of preventing<br />

lock-out [FJ92] by aggressive flows that prevent less aggressive flows from<br />

getting any throughput.

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

Saved successfully!

Ooh no, something went wrong!