Forming a plurality of disjoint routes between border routers MPLS network

Abstract

This paper proposes a way to organize multi-path routing in the MPLS network. Formation of the table tags is based on the modified method of "branch and bound", in which simultaneously generates a plurality of non-intersecting paths with minimal time complexity. For the formation of the tree stands ways, the degree vertices is the main criterion. The path is extended to the top with a minimal degree. Between boundary routers MPLS network proposed the tags tables formation algorithm. The process of formation of the table labels by using LDP label distribution protocol by exchanging signaling packets between neighboring routers. The marks tables between boundary routers MPLS network and a time chart are presented as an example. Determined the computational complexity of the proposed algorithm and provides a comparison of it with the computational complexity of Dijkstra's algorithm.References 5, figures 2, table 8.