 |
Here we present the results of our algorithms compared to shortest path algorithms in maximizing the mean throughput. Positive values mean the MC algorithm is performing better. In this table we can see that MC3 has performed better than the other variations.
In all our simulations we found that the constrain on flow release time, either arbitrary or identical, didn¡¯t have any impact on the evaluation on our objective functions. The min-cut algorithm that chooses its path based on minimum hop performed better in minimizing the mean wait time, minimizing the maximum completion time and maximizing the mean throughput, however, it has insignificant change in the mean slowdown.
|
IEEE/ICACT20210213 Slide.22
[Big Slide]
[YouTube]