{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:05Z","timestamp":1755220985308,"version":"3.43.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1026166813657","type":"journal-article","created":{"date-parts":[[2003,11,3]],"date-time":"2003-11-03T17:50:32Z","timestamp":1067881832000},"page":"187-206","source":"Crossref","is-referenced-by-count":10,"title":["A Preemption-Aware On-line Routing Algorithm for MPLS Networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Fran\u00e7ois","family":"Blanchy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"M\u00e9lon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Leduc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5142868_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/65.826370","volume":"2","author":"P. Aukia","year":"2000","unstructured":"P. Aukia, M. Kodialam, P. Koppol, T. Lakshman, H. Sarin and B. Suter, RATES: A server for MPLS traffic engineering, IEEE Network Magazine 2 (March\/April 2000) 34\u201341.","journal-title":"IEEE Network Magazine"},{"key":"5142868_CR2","doi-asserted-by":"crossref","unstructured":"D. Awduche, L. Berger, D. Gan, T. Li, V. Srinivasan and G. Swallow, RSVP-TE: Extensions to RSVP for LSP tunnels, RFC 3209 (December 2001).","DOI":"10.17487\/rfc3209"},{"key":"5142868_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S1389-1286(02)00270-0","volume":"40","author":"G. Banerjee","year":"2002","unstructured":"G. Banerjee and D. Sidhu, Comparative analysis of path computation techniques for MPLS traffic engineering, Computer Networks 40 (2002) 149\u2013165.","journal-title":"Computer Networks"},{"key":"5142868_CR4","first-page":"50","volume-title":"Dynamic Programming and Modern Control Theory","author":"R. Bellman","year":"1965","unstructured":"R. Bellman and R. Kalaba, Shortest paths through networks, in: Dynamic Programming and Modern Control Theory (Academic Press, New York, 1965) pp. 50\u201354."},{"key":"5142868_CR5","unstructured":"F. Blanchy, L. M\u00e9lon and G. Leduc, Assessment of protocols and algorithms for intra-domain traffic engineering, Deliverable 3.2 for the ATRIUM project funded by the European Commission, available at http:\/\/run.montefiore.ulg.ac.be\/~blanchy (January 2003)."},{"key":"5142868_CR6","doi-asserted-by":"crossref","unstructured":"F. Blanchy, L. M\u00e9lon and G. Leduc, An efficient decentralized on-line traffic engineering algorithm for MPLS networks, in: Proc. of 18th Internat. Teletraffic Congress (ITC 18), September 2003, Berlin, Germany.","DOI":"10.1016\/S1388-3437(03)80190-7"},{"key":"5142868_CR7","unstructured":"J. de Oliveira, C. Scoglio, I. Akyildiz and G. Uhl, A new preemption policy for diffserv-aware traffic engineering to minimize rerouting, in: IEEE INFOCOM, Vol. 1, June 2002, pp. 665\u2013704."},{"key":"5142868_CR8","doi-asserted-by":"crossref","unstructured":"E. Rosen, A. Viswanathan and R. Calon, Multiprotocol label switching architecture, RFC 3031 (January 2001).","DOI":"10.17487\/rfc3031"},{"key":"5142868_CR9","unstructured":"F. L. Faucheur and W. Lai, Requirements for support of diff-serv-aware MPLS traffic engineering, IETF draft draft-ietf-tewg-diff-te-reqts-06.txt (September 2002)."},{"key":"5142868_CR10","doi-asserted-by":"crossref","unstructured":"B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: IEEE INFOCOM, Vol. 2, 2000, pp. 519\u2013528.","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"5142868_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"5142868_CR12","unstructured":"B. Jamoussi, ed., L. Andersson, R. Callon, R. Dantu, L. Wu, P. Doolan, T. Worster, N. Feldman, A. Fredette, M. Girish, E. Gray, J. Heinanen, T. Kilty and A. Malis, Constraint-based LSP setup using LDP, RFC 3212 (January 2002)."},{"key":"5142868_CR13","doi-asserted-by":"crossref","unstructured":"M. S. Kodialam and T. V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, in: IEEE INFOCOM, Vol. 2, 2000, pp. 884\u2013893.","DOI":"10.1109\/INFCOM.2000.832263"},{"key":"5142868_CR14","unstructured":"L. M\u00e9lon, F. Blanchy and G. Leduc, Decentralized local backup LSP calculation with efficient bandwidth sharing, in: Proc. of 10th Internat. Conf. on Telecommunications (ICT '2003), February 2003, Papeete, Tahiti."},{"key":"5142868_CR15","doi-asserted-by":"crossref","unstructured":"M. Peyravian and A.D. Kshemkalyani, Connection preemption: Issues, algorithms, and a simulation study, in: IEEE INFOCOM, April 1997, pp. 143\u2013151.","DOI":"10.1109\/INFCOM.1997.635124"},{"key":"5142868_CR16","doi-asserted-by":"crossref","unstructured":"E. Ricciato, S. Salsano, A. Belmonte and M. Listanti, Offline configuration of a MPLS over WDM network under time-varying offered traffic, in: IEEE INFOCOM, Vol. 1, June 2002, pp. 57\u201365.","DOI":"10.1109\/INFCOM.2002.1019246"},{"key":"5142868_CR17","unstructured":"P. Srisuresh and P. Joseph, TELSAs to extend OSPF for traffic engineering, Internet-draft: draftsrisuresh-ospf-te-02.txt (January 2002)."},{"key":"5142868_CR18","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1016\/S0140-3664(02)00025-7","volume":"25","author":"B. Szviatovszki","year":"2002","unstructured":"B. Szviatovszki, A. Szentesi and A. Juttner, Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing, Computer Communications 25 (2002) 1076\u20131083.","journal-title":"Computer Communications"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026166813657.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026166813657\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026166813657.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:42:13Z","timestamp":1754635333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026166813657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":18,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5142868"],"URL":"https:\/\/doi.org\/10.1023\/a:1026166813657","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}