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

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

Blog Article

This work provides a short analysis of algorithms of multipath routing.The modified algorithm of formation of Pram Toy 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 Grooming 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.