A New Algorithm for Finding Vertex-Disjoint Paths
Journal: The International Arab Journal of Information Technology (Vol.12, No. 6)Publication Date: 2015-11-01
Authors : Mehmet Kurt; Murat Berberler; Onur Ugurlu;
Page : 550-555
Keywords : Vertex-disjoint paths; multipath; Ad-Hoc wireless networks.;
Abstract
The fact that the demands which could be labelled as “luxurious” in the past times, have became requirements makes it inevitable that the service providers do new researches and prepare alternative plans under harsh competition conditions. In order to, provide the customers with the services in terms of the committed standards by taking the possible damages on wired and wireless networks into consideration. Finding vertex disjoint paths gives many advantages on the wired or wireless communication especially on Ad-Hoc Networks. In this paper, we suggest a new algorithm that calculates alternative routes which do not contain common vertex (vertex-disjoint path) with problematic route during a point-to-point communication on the network in a short time and it is compared to similar algorithms
Other Latest Articles
- A Safe Exit Approach for Continuous Monitoring of Reverse K-Nearest Neighbors in Road Networks
- A Gene-Regulated Nested Neural Network
- Improvement in Rebalanced CRT RSA
- Model Based Approach for Content Based Image Retrievals Based on Fusion and Relevancy Methodology
- Enhancing Generic Pipeline Model for Code Clone Detection using Divide and Conquer Approach
Last modified: 2019-11-17 16:59:50