Maximum-Bandwidth Node-Disjoint Paths

TL;DR

This paper introduces a polynomial-time algorithm based on a maximum-cost Dijkstra variant for finding maximum-bandwidth node-disjoint paths, achieving near-optimal results faster than ILP solutions.

Contribution

It proposes a novel polynomial-time method using a maximum-cost Dijkstra variant and virtual nodes for maximum-bandwidth node-disjoint paths, outperforming heuristics.

Findings

Method achieves near-ILP optimal results

Significantly faster than ILP in simulations

Performs better than existing heuristics

Abstract

This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth node-disjoint path. Through several simulations, we compare the performance of our method to a modern heuristic technique and to the ILP solution. We show that, in a polynomial execution time, our proposed method produces results that are almost identical to ILP in a significantly lower execution time.