{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T23:00:59Z","timestamp":1710370859857},"reference-count":0,"publisher":"RFC Editor","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.17487\/rfc7811","type":"report","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T01:07:51Z","timestamp":1466125671000},"source":"Crossref","is-referenced-by-count":9,"title":["An Algorithm for Computing IP\/LDP Fast Reroute Using Maximally Redundant Trees (MRT-FRR)"],"prefix":"10.17487","author":[{"given":"G.","family":"Enyedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Csaszar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Atlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Bowers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Gopalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7045","published-online":{"date-parts":[[2016,6]]},"container-title":[],"original-title":[],"deposited":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T01:07:51Z","timestamp":1466125671000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rfc-editor.org\/info\/rfc7811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":0,"URL":"https:\/\/doi.org\/10.17487\/rfc7811","relation":{},"subject":[],"published":{"date-parts":[[2016,6]]}}}