{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T20:20:19Z","timestamp":1722975619048},"reference-count":0,"publisher":"RFC Editor","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.17487\/rfc5441","type":"report","created":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T16:09:21Z","timestamp":1428768561000},"source":"Crossref","is-referenced-by-count":16,"title":["A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths"],"prefix":"10.17487","author":[{"given":"R.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Bitar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"name":"JL. Le Roux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7045","published-online":{"date-parts":[[2009,4]]},"container-title":[],"original-title":[],"deposited":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T21:08:17Z","timestamp":1428786497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rfc-editor.org\/info\/rfc5441"}},"subtitle":[],"editor":[{"name":"JP. Vasseur","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":0,"URL":"https:\/\/doi.org\/10.17487\/rfc5441","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}