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

Performance Evaluation of Trivium on Raspberry Pi

High connectivity of billions of IoT devices lead to many security issues. Trivium is designed for IoT to overcome the security challenges of IoT. The objective of this study is to implement a security service to provide...

Control Systems application in Java based Enterprise and Cloud Environments – A Survey 

 The classical feedback control systems has been a successful theory in many engineering applications like electrical power, process, and manufacturing industries. For more than a decade there is active research in...

Novel Software-Defined Network Approach of Flexible Network Adaptive for VPN MPLS Traffic Engineering

Multi-Protocol Label Switching VPN (MPLS-VPN) is a technology for connecting multiple remote sites across the operator’s private infrastructure. MPLS VPN offers advantages that traditional solutions cannot guarantee, in...

Reconsideration of Potential Problems of Applying EMIM for Text Analysis

It seems that the term dependence methods developed using the expected mutual information measure (EMIM) have not achieved their potential in many areas of science, involving statistical text analysis or document process...

Secure High Dynamic Range Images

In this paper, a tone mapping algorithm is proposed to produce LDR (Limited Dynamic Range) images from HDR (High Dynamic Range) images. In the approach, non-linear functions are applied to compress the dynamic range of H...

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