Maximum-Bandwidth Node-Disjoint Paths

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 va...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced computer science & applications 2012-01, Vol.3 (3)
Main Author: H, Mostafa
Format: Article
Language:English
Subjects:
Bandwidths
Communication networks
Dijkstra's algorithm
Integer programming
Linear programming
Nodes
Polynomials
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2158-107X
2156-5570
DOI:10.14569/IJACSA.2012.030309