 |
To optimize the end to end routing in the Software Define Network controllers a routing algorithm should be used to maximize performance of the network.
Our simulation showed that the novel max-flow min-cut based algorithm, MC3,with a decision based on minimum hops performed better compared to the traditional shortest path algorithm variants. Our algorithms are topology independent and flow release time independent.
Since network bottlenecks causes performance degradation, our Max-Flow Min-Cut based algorithms explicitly identify the bottlenecks through the min cut edges which holds the least available flows, and, by choosing the edge on the shortest dynamic path, our algorithm is able to find paths that yield significant improvement over the commonly used shortest path algorithms.
The diversity of our MFMC suite of algorithms demonstrates that a shortest path approach, such as MC3, as opposed to a balanced or longer path approach, yields the best expected performance across a broad range network types and flow size distributions
|
IEEE/ICACT20210213 Slide.23
[Big Slide]
[YouTube]