{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:06Z","timestamp":1725492366449},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423034"},{"type":"electronic","value":"9783540477341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47734-9_30","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T01:08:18Z","timestamp":1191719298000},"page":"302-308","source":"Crossref","is-referenced-by-count":4,"title":["Path Computation for Traffic Engineering in MPLS Networks"],"prefix":"10.1007","author":[{"given":"Gargi","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepinder","family":"Sidhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"D. Awudche, J. Malcolm, J. Agogbua, M. O\u2019Dell, J. McManus, \u201cRequirements for Traffic Engineering Over MPLS\u201d, Request for Comments:2072, September 1999.","DOI":"10.17487\/rfc2702"},{"key":"30_CR2","unstructured":"Bilel Jamoussi, \u201cConstraint-Based LSP Setup using LDP\u201d, Work in Progress, July 2000."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"D. Awudche, L. B erger, D. Gan, T. Li, V. Srinivasan, G. Swallow, \u201cRSVP-TE: Extensions to RSVP for LSP Tunnels\u201d, Work in Progress, August 2000.","DOI":"10.17487\/rfc3209"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"M. Kodialam and T. Lakshman, \u201cMinimum Interference Routing with Applications to MPLS Traffic Engineering,\u201d Proceedings of IEEE INFOCOM\u20192000, March 2000.","DOI":"10.1109\/INFCOM.2000.832263"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"D. Eppstein, \u201cFinding the k shortest paths,\u201d SIAM Journal on Computing, 28: 652\u2013673, 1998.","journal-title":"SIAM Journal on Computing"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"B. Fortz, M. Thorup, \u201cInternet Traffic Engineering by Optimizing OSPF Weights\u201d, Proceedings of IEEE INFOCOM\u20192000, March 2000.","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"30_CR7","unstructured":"D. Katz, D. Yeung, \u201cTraffic Engineering Extensions to OSPF\u201d, Work in Progress, Oct. 2000."}],"container-title":["Lecture Notes in Computer Science","Networking \u2014 ICN 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47734-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:48:15Z","timestamp":1556884095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47734-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423034","9783540477341"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-47734-9_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}