 |
In the effort of minimizing the maximum completion time we found that MC3 minimizes it more than all DSP algorithms on average by 9.6%. Moreover, we have found that the maximum completion time for MC3 compared to DSP-md is minimized with flows with Pareto size distribution more than with flows of Gaussian size distribution by 18.2% and 7.5%, respectively. However, the other variation MC1,MC2,MC4 and MC5 have increased the maximum completion time over all DSP algorithms on average by 5.7% . In the Fig we illustrate an example of routing in BA network with arbitrary released time flows with Pareto size distribution
|
IEEE/ICACT20210213 Slide.20
[Big Slide]
[YouTube]