 |
To compare, the highest transfer time witnessed was with
for a = 70 and E THRESHOLD = 0.1. in this scenario,
it would take TCP-CA/RL 700 path changes to converge into
a purely greedy model where TCP-CA/RL would make all
the decisions, which is both inefficient not needed as the data
transfer would have completed well before 700 path changes
were completed.
Lastly, the comparison for the I/O data transfer can be
seen in the figures on this slide and the next where we are visualizing a single
TCP stream of 100 Megabytes of data transfer via iperf
using RL, Random path selection every five seconds, and
using standard TCP congestion control when both priority and
background flows are on the same path, ( which i s provided
to provide a baseline), respectively.
|
IEEE/ICACT20210131 Slide.12
[Big Slide]