DocumentCode
627449
Title
Performance comparison of not-via addresses and maximally redundant trees (MRTs)
Author
Menth, Michael ; Braun, Wolfgang
Author_Institution
Dept. of Comput. Sci., Univ. of Tubingen, Tubingen, Germany
fYear
2013
fDate
27-31 May 2013
Firstpage
218
Lastpage
225
Abstract
Maximally redundant trees (MRTs) have been suggested in IETF as a new promising method for fast rerouting in IP networks. Unlike loop-free alternates (LFAs), they can protect against all link and node failures if topology allows. In this work, we compare MRTs and not-via addresses, which also guarantee full-failure coverage. We evaluate path lengths and relative link loads for single link and node failures in various test networks. The performance of MRTs significantly depends on the chosen root node so that the analysis presented in this paper should be performed before the roll-out of MRTs in operational networks.
Keywords
IP networks; computer network performance evaluation; computer network reliability; telecommunication links; telecommunication network routing; telecommunication network topology; trees (mathematics); IETF; IP networks; MRT; fast rerouting; full-failure coverage; link loads; maximally redundant trees; network topology; node failures; not-via addresses; operational networks; path length evaluation; performance comparison; single link failures; Aggregates; Bandwidth; IP networks; Network topology; Routing; Topology; Tunneling; IP fast reroute; Resilience; resource management;
fLanguage
English
Publisher
ieee
Conference_Titel
Integrated Network Management (IM 2013), 2013 IFIP/IEEE International Symposium on
Conference_Location
Ghent
Print_ISBN
978-1-4673-5229-1
Type
conf
Filename
6572989
Link To Document