Net2Plan

Example: Sets the routing of the traffic between each node pair, as that of the shortest path in number of hops

fa_shortestPath_numHops

For each traffic demand, the algorithm obtains a shortest path in number of hops between the demand end nodes. For this, the library function shortestPath is used. If more than one shortest path exist, only one is used, the one returned by the shortestPath function. Then, netStruct.routingMatrix is set so that all the traffic of the demand is routed through this path.

Download .m file: fa_shortestPath_numHops.m