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.

Mostafa H Dahshan, “Maximum-Bandwidth Node-Disjoint Paths” International Journal of Advanced Computer Science and Applications(IJACSA), 3(3), 2012. http://dx.doi.org/10.14569/IJACSA.2012.030309

@article{Dahshan2012,
title = {Maximum-Bandwidth Node-Disjoint Paths},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2012.030309},
url = {http://dx.doi.org/10.14569/IJACSA.2012.030309},
year = {2012},
publisher = {The Science and Information Organization},
volume = {3},
number = {3},
author = {Mostafa H Dahshan}
}