 |
In our MC suite of algorithms, we have five variations. Each algorithm is varying in the decision criteria it adopts for picking the edge from the cut set. We can see in the table that MC1 and MC2 selects a random edge from the cut set, however, MC2 selects the edge that does not cause any cycles in the path. MC3 bases its selection on being part of a minimum hop path from the source to the destination. MC4 and MC5 are based on the available capacity of the edges, where MC4 selects the edge with minimum capacity which is the most congested and MC5 select the one with maximum capacity which is the least congested.
|
IEEE/ICACT20210213 Slide.09
[Big Slide]
[YouTube]