DocumentCode :
2250900
Title :
On fast computing bypass tunnel routes in MPLS-based local restoration
Author :
Otel, F.-D.
Author_Institution :
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
fYear :
2002
fDate :
2002
Firstpage :
234
Lastpage :
238
Abstract :
We outline a mechanism for fast rerouting IP traffic around link failures using MPLS bypass tunnels. As the main component of this mechanism we propose a simplified single-pair incremental Dijkstra algorithm. We evaluate the algorithm and restoration mechanism performance when used in regular and random network topologies.
Keywords :
multiprotocol label switching; network topology; routing protocols; telecommunication network reliability; telecommunication traffic; IGP routing protocol; IP traffic; MPLS bypass tunnels; MPLS-based local restoration; algorithm complexity; bypass tunnel routes; link failures; multiprotocol label switching; random network topology; regular network topology; restoration mechanism performance; shortest path routing; simplified single-pair incremental Dijkstra algorithm; IP networks; Multiprotocol label switching; Network topology; Optical control; Optical devices; Optical fiber networks; Optical packet switching; Protection; Routing protocols; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Speed Networks and Multimedia Communications 5th IEEE International Conference on
Print_ISBN :
0-7803-7600-5
Type :
conf
DOI :
10.1109/HSNMC.2002.1032582
Filename :
1032582
Link To Document :
بازگشت