An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR). Enyedi, G., Csaszar, A., Atlas, A., Bowers, C., & Gopalan, A. Technical Report 7811, IETF, June, 2016. Paper bibtex @techreport{RFC7811,
title = {{An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)}},
author = {Enyedi, G. and Csaszar, A. and Atlas, A. and Bowers, C. and Gopalan, A.},
type = {RFC},
number = {7811},
institution = {IETF},
month = jun,
year = 2016,
url = {http://tools.ietf.org/rfc/rfc7811.txt},
}
Downloads: 0
{"_id":"w7i5u7mTdpNjnpFo9","bibbaseid":"enyedi-csaszar-atlas-bowers-gopalan-analgorithmforcomputingipldpfastrerouteusingmaximallyredundanttreesmrtfrr-2016","author_short":["Enyedi, G.","Csaszar, A.","Atlas, A.","Bowers, C.","Gopalan, A."],"bibdata":{"bibtype":"techreport","type":"RFC","title":"An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)","author":[{"propositions":[],"lastnames":["Enyedi"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Csaszar"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Atlas"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Bowers"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Gopalan"],"firstnames":["A."],"suffixes":[]}],"number":"7811","institution":"IETF","month":"June","year":"2016","url":"http://tools.ietf.org/rfc/rfc7811.txt","bibtex":"@techreport{RFC7811,\n title = {{An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)}},\n author = {Enyedi, G. and Csaszar, A. and Atlas, A. and Bowers, C. and Gopalan, A.},\n type = {RFC},\n number = {7811},\n institution = {IETF},\n month = jun,\n year = 2016,\n url = {http://tools.ietf.org/rfc/rfc7811.txt},\n}\n\n","author_short":["Enyedi, G.","Csaszar, A.","Atlas, A.","Bowers, C.","Gopalan, A."],"key":"RFC7811","id":"RFC7811","bibbaseid":"enyedi-csaszar-atlas-bowers-gopalan-analgorithmforcomputingipldpfastrerouteusingmaximallyredundanttreesmrtfrr-2016","role":"author","urls":{"Paper":"http://tools.ietf.org/rfc/rfc7811.txt"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"techreport","biburl":"https://raw.github.com/hupili/rfc.bib/master/rfc.bib","dataSources":["QXhRq9CSEi44amsga"],"keywords":[],"search_terms":["algorithm","computing","ldp","fast","reroute","using","maximally","redundant","trees","mrt","frr","enyedi","csaszar","atlas","bowers","gopalan"],"title":"An Algorithm for Computing IP/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)","year":2016}