An Investigation into Transport Protocols and Data Transport ...

9.3. Internet Transfers 240
Fraction Bytes Retransmitted per Mbit/sec
10 −4
10 −6
10 −8
10 −10
10 −12
Standard TCP HSTCP ScalableTCP HTCP FAST BicTCP
New−TCP
Figure 9.36: Overhead from CERN to LBL.
Goodput (mbit/sec)
200
180
160
140
120
100
80
60
40
20
0
Standard TCP HSTCP ScalableTCP HTCP FAST BicTCP
New−TCP
Figure 9.37: Goodput from CERN to RAL.
of the HSTCP and ScalableTCP flows.
BicTCP has the lowest inter-quartile range of all the algorithms and shows
that it is able to achieve the least overhead of all of the New-TCP algorithms.
FAST, unlike the tests to Dublin, exhibited the highest overhead with
the greatest fraction of bytes retransmitted per unit goodput. However, the
results are comparable to that of H-TCP.
9.3.5 Results: CERN to RAL
Goodput
The goodput performance to RAL is show in Figure 9.37. Even though the
machines and networks are capable of 1Gb/sec, it demonstrates that the