{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:28:27Z","timestamp":1648621707506},"reference-count":22,"publisher":"Elsevier BV","issue":"11-12","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0140-3664(02)00025-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:34:02Z","timestamp":1027575242000},"page":"1076-1084","source":"Crossref","is-referenced-by-count":14,"title":["Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing"],"prefix":"10.1016","volume":"25","author":[{"given":"Bal\u00e1zs","family":"Szviatovszki","sequence":"first","affiliation":[]},{"given":"\u00c1ron","family":"Szentesi","sequence":"additional","affiliation":[]},{"given":"Alp\u00e1r","family":"J\u00fcttner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00025-7_BIB1","unstructured":"D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, X. Xiao, A frame-work for Internet traffic engineering, Internet Engineering Task Force, Internet Draft, July 2000, Work in progress."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB2","unstructured":"C. Villamizar, MPLS traffic engineering in a QoS capable network, Slide presentation given at the MPLS'2000 Conference, October 2000, http:\/\/www.ail.gmu.edu\/MPLS2000."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB3","unstructured":"J.A. Garay, I.S. Gopal, Call preemption in communication networks, IEEE INFOCOM'92, 3 vol. xxvii+2515, pp. 1043\u201350, vol. 3."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB4","article-title":"A case study of multiservice, multipriority traffic engineering design for data networks","author":"Mitra","year":"1999","journal-title":"IEEE Globecom'99"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB5","doi-asserted-by":"crossref","unstructured":"D. Awduche, L. Berger, D.H. Gan, T. Li, G. Swallow, V. Srinivasan, RSVP-TE: extensions to RSVP for LSP tunnels, Internet Engineering Task Force, Internet Draft, August 2000, Work in progress.","DOI":"10.17487\/rfc3209"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB6","unstructured":"B. Jamoussi (Ed.), Constraint-based LSP setup using LDP, Internet Engineering Task Force, Internet Draft, July 2000, Work in progress."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB7","unstructured":"D. Katz, D. Yeung, Traffic engineering extensions to OSPF, Internet Engineering Task Force, Internet Draft, April 2000, Work in progress."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB8","unstructured":"T. Li, H. Smit, IS\u2013IS extensions for traffic engineering, Internet Engineering Task Force, Internet Draft, September 2000, Work in progress."},{"issue":"11","key":"10.1016\/S0140-3664(02)00025-7_BIB9","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1016\/S0169-7552(97)00139-6","article-title":"Decentralised network connection preemption algorithms","volume":"30","author":"Peyravian","year":"1998","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB10","unstructured":"K. Kompella, D. Awduche, Notes on path computation in constraint-based routing, Internet Engineering Task Force, Internet Draft, September 2000, Work in progress."},{"issue":"7","key":"10.1016\/S0140-3664(02)00025-7_BIB11","first-page":"1228","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE JSAC"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB12","doi-asserted-by":"crossref","unstructured":"G. Apostolopoulos, R. Williams, S. Kamat, R. Guerin, A. Orda, A. Przygienda, QoS routing mechanisms and OSPF extensions, Internet Engineering Task Force, Request For Comments (Proposed Standard) 2676, August 1999.","DOI":"10.17487\/rfc2676"},{"issue":"6","key":"10.1016\/S0140-3664(02)00025-7_BIB13","first-page":"1128","article-title":"Competitive routing of virtual circuits in ATM networks","volume":"13","author":"Plotkin","year":"1995","journal-title":"IEEE JSAC"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB14","unstructured":"M. Kodialam, T.V. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, INFOCOM 2000, Tel Aviv, Israel, March 2000."},{"issue":"1","key":"10.1016\/S0140-3664(02)00025-7_BIB15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S1389-1286(00)00105-5","article-title":"Analysis of link cost functions for PNNI routing","volume":"34","author":"Magi","year":"2000","journal-title":"Computer Networks"},{"issue":"2","key":"10.1016\/S0140-3664(02)00025-7_BIB16","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/90.917073","article-title":"Evaluating the impact of stale link state on quality-of-service routing","volume":"9","author":"Shaikh","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/316194.316225","article-title":"Load-sensitive routing of long-lived IP flows","author":"Shaikh","year":"1999","journal-title":"ACM SIGCOMM"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/248157.248175","article-title":"Routing high-bandwidth traffic in max\u2013min fair share networks","author":"Ma","year":"1996","journal-title":"ACM SIGCOMM"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB19","unstructured":"Q. Ma, P. Steenkiste, On path selection for traffic with bandwidth guarantees, IEEE International Conference on Network Protocols, October 1997, pp. 191\u2013202."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB20","unstructured":"B. Szviatovszki, \u00c1. Szentesi, A. J\u00fcttner, Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing 2001, International Symposium of Performance Evaluation of Computer and Telecommunication Systems, July, 2001, pp. 249\u2013261."},{"key":"10.1016\/S0140-3664(02)00025-7_BIB21","doi-asserted-by":"crossref","unstructured":"D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, Requirements for traffic engineering over MPLS, Internet Engineering Task Force, Request For Comments (Proposed Standard) 2702, September 1999.","DOI":"10.17487\/rfc2702"},{"key":"10.1016\/S0140-3664(02)00025-7_BIB22","unstructured":"Russ Haynal's ISP Page, http:\/\/navigators.com\/isp.html."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402000257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402000257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T17:52:57Z","timestamp":1578419577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402000257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":22,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0140366402000257"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00025-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}