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 carried out due here to their reconfiguration with adjacent deadlock path.Reconfigurations are realized within the subgraphs includin