A New MPLS Fault Restoration Algorithm Based on Simulated Annealing and Tabu Search

Author

Lin, Na ; Li, Haixing ; Luo, Yang

Author_Institution

Dept. of Comput., Shenyang Aerosp. Univ., Shenyang, China

fYear

2011

Firstpage

1

Lastpage

4

Abstract

MPLS networks use label technique for data transmission. For the rerouting mode, the backbone network demands short restoration time and the QoS guarantee. This paper proposes a new MPLS Fault Restoration Algorithm called NRRA based on Simulated Annealing and Tabu Search. When faults appears in the path, the algorithm can calculate a new optimal path with the new network state again, and the new path is also with the QoS guarantee. The experimental results indicated that NRRA had good algorithm convergence, and the MPLS network also had short restoration time and the path had best performance.

Keywords

convergence; multiprotocol label switching; quality of service; search problems; simulated annealing; telecommunication network routing; MPLS fault restoration algorithm; MPLS networks; NRRA; QoS guarantee; Tabu search; data transmission; label technique; multiprotocol label switching network; rerouting mode; simulated annealing; Algorithm design and analysis; Bandwidth; Cost function; Delay; Multiprotocol label switching; Network topology; Simulated annealing;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Conference_Location

Wuhan

ISSN

2161-9646

Print_ISBN

978-1-4244-6250-6

Type

conf

DOI

10.1109/wicom.2011.6040453

Filename

6040453