The basic routing algorithms for networks with label switching are considered. The mathematical formulation for minimum interference routing problem is given. Algorithms for calculating the optimal routes for minimum interference routing protocols are given. The computational complexity of algorithms for routing in MPLS is estimated. The simulation-based comparative analysis of the efficiency of the available channel resources distribution for main routing protocols in MPLS is given.
routing, optimization, label switching, minimum interference, network simulation