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 211
- Downloads 0
Kalman Filters for Estimating the potential GDP
The estimation of the potential GDP has a twofold importance: on one hand its accurate estimation allows the correct dimensioning of the macroeconomic policies and on the other hand, the study of potential GDP is a resea...
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 (...
An Attribute Involved Public Key Cryptosystem Based on P-Sylow Subgroups and Randomization
The Asymmetric Key Cryptosystem (AKC) or Public Key Encryption (PKE) is a mechanism used to encrypt the messages by using public key and decrypt the enciphered messages by using private key. Of late, the Attribute-Base...
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...
Real World Applications of MGR, Neeva and KN-Hash
Hash functions have prominent role in cryptography because of their ubiquitous applications in real world. Earlier, it was used for authentication only but with continuous research and development, it has been started us...