Net2Plan

Example: Shortest path routing and then set the capacities to match a given link utilization

cfa_shortestPathInKmFixedUtilization

This algorithm obtains sets traffic routing as the shortest path (in km) between the demand end nodes. Then, it sets the link capacities so that each link has a fixed utilization rho , given as input parameter.

The algorithm calls the function fa_shortestPath_km to obtain the shortest path routing.

Once the routing is set, it is possible to calculate the traffic y_e that traverses each link . Then, link capacities are set so that $frac{y_e}{u_e} = rho$ .

Download .m file: cfa_shortestPathInKmFixedUtilization.m