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

Study of Complexities in Bouncing Ball Dynamical System

Evolutionary motions in a bouncing ball system consisting of a ball having a free fall in the Earth’s gravitational field have been studied systematically. Because of nonlinear form of the equations of motion, evolutions...

Two-dimensional Spectral Approximation

In this article, we propose a two-dimensional polynomial basis which extends Legendre series approximation to bivariate functions. We also present a theoretical study of the stability and the error estimation of the Ta...

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...

Improvement of Gregory’s Formula Using Artificial Bee Colony Algorithm

Solving numerical integration is an important question in scientific calculations and engineering. Gregory’s method is among the very first quadrature formulas ever described in the literature, dating back to James Gregory...

Mining Social Media and DBpedia Data Using Gephi and R

The big data is playing a big role in the field of machine learning and data mining. To extract meaningful and interesting information from big data mining is a challenge. The size of the data at social media and Wikiped...

Download PDF file
  • EP ID EP446620
  • DOI 10.4316/JACSM.201701002
  • Views 193
  • Downloads 0

How To Cite

KULKARNI Shrirang Ambaji, G. RAO Raghavendra (2017). A Method of Forming the Optimal Set of Disjoint Path in Computer Networks. Journal of Applied Computer Science & Mathematics, 11(23), 13-16. https://europub.co.uk/articles/-A-446620