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

APφ(R, C)-Spaces of Almost Periodic Functions

The spaces APφ(R, C), corresponding to functions φ ∈ K = Kamke class, have been defined and a few of their properties have been investigated in our recent paper [1]. The aim of this paper is to present some facts/propert...

IT&C used by Individuals and Economic Development in Romania - Application of Cointegration and Vector Error Correction Model

Since the first decade of the 21st century, information and communication technology has become both a tool for the individual and, in many cases, a way of life. Undoubtedly, the Internet has revolutionized the society i...

Framework for Urdu News Headlines Classification

Automatic text classification has great significance in the field of text mining and plays a pivotal role in areas such as spam filtering, news classification, noise reduction etc. It is evident from the literature that...

Identification of Core Architecture Classes for Object-Oriented Software Systems

The new member of the software development team needs to understand the software prior making modifications to the unknown system. The core classes that constitute the system architecture can reveal important structural...

Reduced Differential Transform Method for Exact Solution of Parabolic and Hyperbolic Partial Differential Equations

Aim of the paper is to obtain solution of parabolic, elliptical and coupled partial differential equation using Reduced Differential Transform Method (RDTM). The results are compared with solution obtained by other metho...

Download PDF file
  • EP ID EP446620
  • DOI 10.4316/JACSM.201701002
  • Views 200
  • 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