A Method of Forming the Optimal Set of Disjoint Path in Computer Networks
Autor: | As’ad Mahmoud As’ad Alnaser |
---|---|
Rok vydání: | 2017 |
Předmět: | |
Zdroj: | Journal of Applied Computer Science & Mathematics, Vol 11, Iss 1, Pp 9-12 (2017) |
ISSN: | 2066-3129 2066-4273 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |