IEEE/ICACT20210131 Slide.13        [Big Slide]       Oral Presentation
Comparing specifically, we can see that the time taken to transfer 100 Megabytes of data varies by approximately 60 seconds. Furthermore, on average the number of packets being transferred is hovering between 80 and 100 packets, except for the dip down to 20 when both priority and congested flow paths are on the same path, which is significantly greater in Figure 3 which is purely random. The drop in packet transfer significantly lessens with time a s well, which shows that the RL algorithm is able to learn which path is congested and actively avoid that, further proving our algorithm. In this case, the RL algorithm is able to correctly choose the path 750 seconds into the data transfer, which is completed by around 1000 seconds, meaning if the data transfer was for a longer period of time, we would have seen far superior transfer times compared to random path selection.

[Go to Next Slide]
Select Voice: