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 212
- Downloads 0
Development of Student Information Management System based on Cloud Computing Platform
The management and provision of information about the educational process is an essential part of effective management of the educational process in the institutes of higher education. In this paper the requirements of a...
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...
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...
Application Of Mathematical Methods For Condition Monitoring Of Oil And Gas Facilities
irections for numerical realization of two-dimensional models in different frames account for environmental heterogeneity of matter distribution have been presented. The schemes allow to measure concentration of substanc...
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...