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 Design of Pipelined Architecture for on-the-Fly Processing of Big Data Streams

Conventional processing infrastructures have been challenged by huge demand of stream-based applications. The industry responded by introducing traditional stream processing engines along-with emerged technologies. The o...

Performance Analysis Of Multi Source Fused Medical Images Using Multiresolution Transforms

Image fusion combines information from multiple images of the same scene to get a composite image that is more suitable for human visual perception or further image-processing tasks. In this paper the multi source medica...

FNN based Adaptive Route Selection Support System

This paper presents Fuzzy Neural Network (FNN) based Adaptive Route Selection Support System (ARSSS) for assisting drivers of vehicles. The aim of the proposed ARSSS system is to select path based on shortest possible ti...

Implicit and Explicit Knowledge Mining of Crowdsourced Communities: Architectural and Technology Verdicts

The use of social media especially community Q&A Sites by software development community has been increased significantly in past few years. The ever mounting data on these Q&A Sites has open up new horizons for research...

 : Ear Recognition using Dual Tree Complex Wavelet Transform

 nce last 10 years, various methods have been used for ear recognition. This paper describes the automatic localization of an ear and it’s segmentation from the side poses of face images. In this paper, authors have...

Download PDF file
  • EP ID EP114172
  • DOI -
  • Views 112
  • 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