{"draft":"draft-ietf-rtgwg-mrt-frr-algorithm-09","doc_id":"RFC7811","title":"An Algorithm for Computing IP\/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)","authors":["G. Enyedi","A. Csaszar","A. Atlas","C. Bowers","A. Gopalan"],"format":["ASCII","HTML"],"page_count":"118","pub_status":"PROPOSED STANDARD","status":"PROPOSED STANDARD","source":"Routing Area Working Group","abstract":"This document supports the solution put forth in \"An Architecture for\r\nIP\/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)\"\r\n(RFC 7812) by defining the associated MRT Lowpoint algorithm that is\r\nused in the Default MRT Profile to compute both the necessary\r\nMaximally Redundant Trees with their associated next hops and the\r\nalternates to select for MRT-FRR.","pub_date":"June 2016","keywords":["MRT","FRR","LFA","recovery","failure","routing"],"obsoletes":[],"obsoleted_by":[],"updates":[],"updated_by":[],"see_also":[],"doi":"10.17487\/RFC7811","errata_url":null}