A Simple Polynomial Time Framework for Reduced-Path Decomposition in Multi-Path Routing

In this work, in addition to increasing the bandwidth efficiency we address the complexity of network management and operations. This issue is explicitly addressed by our novel framework, a simple polynomial time algorithm (SimPol) that achieves optimum network performance (in terms of congestion or bandwidth consumption) using only a small number of paths.