Maximum-Bandwidth Node-Disjoint Paths

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. 

Authors and Affiliations

Mostafa H. Dahshan

Keywords

Related Articles

A Low Cost FPGA based Cryptosystem Design for High Throughput Area Ratio

Over many years, Field Programmable Gated Ar-rays (FPGA) have been used as a target device for various prototyping and cryptographic algorithm applications. Due to the parallel architecture of FPGAs, the flexibility of c...

Dist-Coop: Distributed Cooperative Transmission in UWSNs using Optimization Congestion Control and Opportunistic Routing

One of the real issues in UWSN is congestion control. The need is to plan an optimized congestion control scheme which enhances the network life time and in addition limits the usage of energy in data transmission from s...

Intelligent System for Detection of Abnormalities in Human Cancerous Cells and Tissues

Due to the latest advances in the field of MML (Medical Machine Learning) a significant change has been witnessed and traditional diagnostic procedures have been converted into DSS (Decision Support Systems). Specially,...

Spectral Classification of a Set of Hyperspectral Images using the Convolutional Neural Network, in a Single Training

Hyperspectral imagery has seen a great evolution in recent years. Consequently, several fields (medical, agriculture, geosciences) need to make the automatic classification of these hyperspectral images with a high rate...

Voltage Variation Signals Source Identification and Diagnosis Method

Power Quality (PQ) problem has become an important issue for generating bad impact to the users nowadays. It is important to detect and identify the source of the PQ problem. This paper presents a voltage variation signa...

Download PDF file
  • EP ID EP114172
  • DOI -
  • Views 118
  • Downloads 0

How To Cite

Mostafa H. Dahshan (2012).  Maximum-Bandwidth Node-Disjoint Paths. International Journal of Advanced Computer Science & Applications, 3(3), 48-56. https://europub.co.uk/articles/-A-114172