Work

Maximum-Bandwidth Node-Disjoint Paths

Year: 2013

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1305.0907

Author: Dahshan, Mostafa H.

Institution: King Saud University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: green

Funders: King Saud University, Research Center of the College of Computer and Information Sciences, King Saud University

OpenAlex ID: W1924676921

Cites: 8

Cited by: 1

Related to: 20