Heuristics for rerouting of label switched paths in MPLS based IP networks

The growth of the Internet has caused the development of new protocols that enable IP networks to be engineered efficiently. One such protocol, multiprotocol label switching (MPLS) enables IP networks with quality of service to be traffic engineered well. Rerouting of label switched paths (LSP) is caused due to link or node failure or recovery, connection admission or load balancing. In this paper, we deal with the problem of reroute sequence planning of LSPs. We introduce a number of new heuristic approaches, and refinements into the existing ones, which are evaluated by simulation using data from real network topologies. Results show that two of the new heuristic approaches behave better than the existing ones and improve the performance.