|Research Unit in Networking|
and G. Leduc1
1 Research unit in Networking, EECS department, University of Liège, Belgium
AbstractThis article is dealing with a quantitative comparison of different fast restoration approaches in the context of a Multi-Protocol Label Switching (MPLS) network. The objective is to analyse the general behaviour of these approaches (local rerouting, edge-to-edge rerouting, ...) in case of failure by means of simulations. This study is realised in the context of Best Effort only traffic, routing being done with a shortest paths algorithm. Many papers justify the choice between an edge-to-edge or a local scheme by means of intuition and then present a new algorithm for routing backup paths which try to optimize some parameters. Our approach aims to clarify the situation by comparing by means of concrete results the pros and cons of each mechanism.
Editor: - G. Leduc -
Webmaster: - C. Soldani -
|Still running IPv4 at: 188.8.131.52...||