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

A Method of Forming the Optimal Set of Disjoint Path in Computer Networks

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

Dynamic Lyapunov Indicator (DLI): A Perfect indicator for Evolutionary System

Recently proposed indicators along with their abilities for identification of chaotic motion have been described. These are Fast Lyapunov Exponents (FLI), Smaller Alignment Indices (SALI) and Dynamic Lyapunov Indicator (...

Novel Crypting Methods Based on Singular Values Decomposition

With the rapid development of multimedia exchanges, it is necessary to dispose secure systems to protect data and ensure the security of transfer. Two encryption schemes are proposed in this letter where the second is ob...

Template Matching of Colored Image Based on Quaternion Fourier Transform and Image Pyramid Techniques

–Template matching method is one of the most significant object recognition techniques and it has many applications in the field of digital signal processing and image processing and it is the base for object tracking in...

The Evolution of the Processing Power Needed by the Primary Cryptocurrencies and its profit.

This paper intends to follow the evolution of the processing power needed to mine cryptocurrencies. Because by this year, 2018, they evolved to being over 1500 cryptos, we shell consider reviewing the first 5: Bitcoin, E...

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