MPLS shortest path demo
MPLS shortest node path. Dijkstra's short path algorithm in VBA.
Modified input to the formula, caters for the following conditions.
1. Bandwidth available
2. Protocol compatible
3. Load balancing.
You can Design a network , prior to configuration.
You can simulate network breaks in advance.
"The physical connections of an MPLS network are akin to the logical structures of SDH" that is why their paths are predictable
amazingly, just 50 lines of code.