THE HOP-LIMIT APPROACH FOR FLOW ASSIGNMENT IN SURVIVABLE CONNECTION-ORIENTED NETWORKS

This paper describes a novel method for flow assignment in survivable connection-oriented networks. The considered optimization problem is NP-complete and computationally difficult. In order to reduce size of the problem we propose to consider all networks eligible routes, which do not violate a predetermined hop-limit value. We focus on one of restoration methods - local rerouting – used in popular network technique MultiProtocol Label Switching (MPLS) to provide survivability. Seven various networks are analyzed to examine and evaluate the proposed approach.