A Method of Forming the Optimal Set of Disjoint Path in Computer Networks
Journal Title: Journal of Applied Computer Science & Mathematics - Year 2017, Vol 11, Issue 23
Abstract
This work provides a short analysis of algorithms of multipath routing. The modified algorithm of formation of the maximum set of not crossed paths taking into account their metrics is offered. Optimization of paths is carried out due to their reconfiguration with adjacent deadlock path. Reconfigurations are realized within the subgraphs including only peaks of the main and an adjacent deadlock path. It allows to reduce the field of formation of an optimum path and time complexity of its formation.
Authors and Affiliations
KULKARNI Shrirang Ambaji, G. RAO Raghavendra
Keywords
Related Articles
- EP ID EP446620
- DOI 10.4316/JACSM.201701002
- Views 168
- Downloads 0
Complexities in a Plant-Herbivore Model
A simple host-parasite type model has been considered to study the interaction of certain plants and herbivores. The two dimensional discrete time model utilizes leaf and herbivore biomass as state variables. The paramet...
Removal of Baseline Wander Noise from Electrocardiogram (ECG) using Fifth-order Spline Interpolation
Abstract–Baseline wandering can mask some important features of the Electrocardiogram (ECG) signal hence it is desirable to remove this noise for proper analysis and display of the ECG signal. This paper presents the imp...
Approximate solution of high-order integro-differential equations using radial basis functions
In this paper, we present a numerical method to solve linear and nonlinear high-order Volterra integro-differential equations. This method is based on interpolating by radial basis functions, using Legendre-Gauss-Lobatto...
Data mining techniques for e-learning
Data Mining (DM), sometimes called Knowledge Discovery in Databases (KDD), is a powerful new technology with great potential to help companies focus on the most important information in the data they have collected via t...
Coefficient Inequalities for Certain Class of Analytic Functions of Complex Order
In this paper, we define the class b L of normalized analytic functions of complex order in the open unit disk, sufficient condition involving coefficient inequalities for () fz to be in the class b L of analytic fun...