{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T13:00:41Z","timestamp":1761397241050,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1389-1286(01)00308-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T10:29:16Z","timestamp":1034591356000},"page":"165-183","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"title":["Optimal policy for label switched path setup in MPLS networks"],"prefix":"10.1016","volume":"39","author":[{"given":"T.","family":"Anjali","sequence":"first","affiliation":[]},{"given":"C.","family":"Scoglio","sequence":"additional","affiliation":[]},{"given":"J.C.","family":"de Oliveira","sequence":"additional","affiliation":[]},{"given":"I.F.","family":"Akyildiz","sequence":"additional","affiliation":[]},{"given":"G.","family":"Uhl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"E. Rosen, A. Viswanathan, R. Callon, Multiprotocol label switching architecture, IETF RFC 3031, January 2001, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB1","DOI":"10.17487\/rfc3031"},{"doi-asserted-by":"crossref","unstructured":"D.O. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan, G. Swallow, RSVP-TE: extensions to RSVP for LSP tunnels, IETF RFC 3209, December 2001, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB2","DOI":"10.17487\/rfc3209"},{"doi-asserted-by":"crossref","unstructured":"D.O. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, Requirements for traffic engineering over MPLS, IETF RFC 2702, September 1999, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB3","DOI":"10.17487\/rfc2702"},{"doi-asserted-by":"crossref","unstructured":"S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, An architecture for differentiated services, IETF RFC 2475, December 1998, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB4","DOI":"10.17487\/rfc2475"},{"doi-asserted-by":"crossref","unstructured":"J. Heinanen, F. Baker, W. Weiss, J. Wroclawski, Assured forwarding PHB group, IETF RFC 2597, June 1999, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB5","DOI":"10.17487\/rfc2597"},{"doi-asserted-by":"crossref","unstructured":"V. Jacobson, K. Nichols, K. Poduri, An expedited forwarding PHB, IETF RFC 2598, June 1999, Available from ","key":"10.1016\/S1389-1286(01)00308-5_BIB6","DOI":"10.17487\/rfc2598"},{"unstructured":"M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, in: Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000","key":"10.1016\/S1389-1286(01)00308-5_BIB7"},{"doi-asserted-by":"crossref","unstructured":"S. Uhlig, O. Bonaventure, On the cost of using MPLS for interdomain traffic, in: Quality of Future Internet Services, Berlin, Germany, September 2000, pp. 141\u2013152","key":"10.1016\/S1389-1286(01)00308-5_BIB8","DOI":"10.1007\/3-540-39939-9_12"},{"doi-asserted-by":"crossref","unstructured":"C. Scoglio, T. Anjali, J. de Oliveira, I. Akyildiz, G. Uhl, A new threshold-based policy for label switched path set up in MPLS networks, in: Proceedings of 17th International Teletraffic Congress 2001, Salvador, Brazil, September 2001","key":"10.1016\/S1389-1286(01)00308-5_BIB9","DOI":"10.1016\/S1388-3437(01)80106-2"},{"year":"1994","author":"Puterman","series-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","key":"10.1016\/S1389-1286(01)00308-5_BIB10"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128601003085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128601003085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:57:07Z","timestamp":1761397027000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128601003085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1389128601003085"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(01)00308-5","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal policy for label switched path setup in MPLS networks","name":"articletitle","label":"Article Title"},{"value":"Computer Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1389-1286(01)00308-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}