| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20210213 Slide.07
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
The flow routing process happens in two steps: selecting a flow from the flow set then find a route for that flow. Our algorithm is used for the second step of this process, finding a path. We utilize the MFMC process in partitioning the network by a recursive loop of cuts where each cut contains a set of minimum number of edges with their removal the source and the destination are disconnected. The bandwidth of a path is defined as the minimum edge capacity in the path | |
| [Go to Next Slide] |