(WG chair hat off) We have updated draft-enyedi-rtgwg-mrt-frr-algorithm-03.txt and added an analysis and comparison.
Discussion would be welcome. Regards, Alia -------- Original message -------- From: [email protected] Date: 07/15/2013 4:20 PM (GMT-08:00) To: Gabor Sandor Envedi <[email protected]>,Andras Csaszar <[email protected]>,Alia Atlas <[email protected]>,"cbowers@" <[email protected]>,Abishek Gopalan <[email protected]>,Chris Bowers <[email protected]>,Andras Csaszar <[email protected]>,Gabor Sandor Enyedi <[email protected]> Subject: New Version Notification for draft-enyedi-rtgwg-mrt-frr-algorithm-03.txt A new version of I-D, draft-enyedi-rtgwg-mrt-frr-algorithm-03.txt has been successfully submitted by Gabor Sandor Enyedi and posted to the IETF repository. Filename: draft-enyedi-rtgwg-mrt-frr-algorithm Revision: 03 Title: Algorithms for computing Maximally Redundant Trees for IP/LDP Fast- Reroute Creation date: 2013-07-15 Group: Individual Submission Number of pages: 51 URL: http://www.ietf.org/internet-drafts/draft-enyedi-rtgwg-mrt-frr-algorithm-03.txt Status: http://datatracker.ietf.org/doc/draft-enyedi-rtgwg-mrt-frr-algorithm Htmlized: http://tools.ietf.org/html/draft-enyedi-rtgwg-mrt-frr-algorithm-03 Diff: http://www.ietf.org/rfcdiff?url2=draft-enyedi-rtgwg-mrt-frr-algorithm-03 Abstract: A complete solution for IP and LDP Fast-Reroute using Maximally Redundant Trees is presented in [I-D.ietf-rtgwg-mrt-frr- architecture]. This document defines the associated MRT Lowpoint algorithm that is used in the default MRT profile to compute both the necessary Maximally Redundant Trees with their associated next-hops and the alternates to select for MRT-FRR. The IETF Secretariat
_______________________________________________ rtgwg mailing list [email protected] https://www.ietf.org/mailman/listinfo/rtgwg
