{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:29:23Z","timestamp":1734067763467,"version":"3.30.2"},"reference-count":26,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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 Networks"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s1389-1286(03)00290-1","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:47:42Z","timestamp":1054075662000},"page":"557-572","source":"Crossref","is-referenced-by-count":2,"title":["Prompt partial path optimization in MPLS networks"],"prefix":"10.1016","volume":"43","author":[{"given":"D\u00e1niel","family":"Orincsay","sequence":"first","affiliation":[]},{"given":"Bal\u00e1zs","family":"Szviatovszki","sequence":"additional","affiliation":[]},{"given":"G\u00e9za","family":"B\u00f6hm","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"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 2676, August 1999","key":"10.1016\/S1389-1286(03)00290-1_BIB1","DOI":"10.17487\/rfc2676"},{"doi-asserted-by":"crossref","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, On-line machine scheduling with applications to load balancing and virtual circuit routing, in: Proceedings of 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 623\u2013631","key":"10.1016\/S1389-1286(03)00290-1_BIB2","DOI":"10.1145\/167088.167248"},{"issue":"2","key":"10.1016\/S1389-1286(03)00290-1_BIB3","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/65.826370","article-title":"RATES: a server for MPLS traffic engineering","volume":"14","author":"Aukia","year":"2000","journal-title":"IEEE Network"},{"unstructured":"M. Berkelaar, J. Dirks, lp_solve 2.2, ftp:\/\/ftp.es.ele.tue.nl\/pub\/lp_solve","key":"10.1016\/S1389-1286(03)00290-1_BIB4"},{"unstructured":"CAIDA: Cooperative Association for Internet Data Analysis, The CAIDA Web Site, http:\/\/www.caida.org, 2003","key":"10.1016\/S1389-1286(03)00290-1_BIB5"},{"unstructured":"Ca*net 4 Plans Customer Control of Lambdas, The Cook Report on Internet, http:\/\/www.cookreport.com\/10.10.shtml, January 2002 (10.10)","key":"10.1016\/S1389-1286(03)00290-1_BIB6"},{"issue":"1","key":"10.1016\/S1389-1286(03)00290-1_BIB7","first-page":"42","article-title":"Management solutions for IP networks","volume":"77","author":"Forsl\u00f6w","year":"2000","journal-title":"Ericsson Review"},{"doi-asserted-by":"crossref","unstructured":"B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, IEEE INFOCOM, March 2000","key":"10.1016\/S1389-1286(03)00290-1_BIB8","DOI":"10.1109\/INFCOM.2000.832225"},{"unstructured":"B.G. J\u00f3zsa, D. Orincsay, Random graph generator (for telecommunication networks), Technical Report, Ericsson Research, TrafficLab, Budapest, Hungary, 1999","key":"10.1016\/S1389-1286(03)00290-1_BIB9"},{"issue":"3","key":"10.1016\/S1389-1286(03)00290-1_BIB10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1015318600381","article-title":"An efficient algorithm for global path optimization in MPLS networks","volume":"2","author":"J\u00f3zsa","year":"2001","journal-title":"Optimization and Engineering"},{"issue":"2","key":"10.1016\/S1389-1286(03)00290-1_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S1389-1286(03)00189-0","article-title":"On the solution of reroute sequence planning problem in MPLS networks","volume":"42","author":"J\u00f3zsa","year":"2003","journal-title":"Computer Networks"},{"unstructured":"A. J\u00fcttner, B. Szviatovszki, \u00c1. Szentesi, D. Orincsay, J. Harmatos, On-demand optimization of label switched paths in MPLS networks, ICCCN 2000, Las Vegas, 2000","key":"10.1016\/S1389-1286(03)00290-1_BIB12"},{"unstructured":"C. Liljenstolpe, Offline traffic engineering in a large ISP setting, Internet Engineering Task Force, Internet Draft, November 2001, Work in Progress","key":"10.1016\/S1389-1286(03)00290-1_BIB13"},{"doi-asserted-by":"crossref","unstructured":"Q. Ma, P. Steenkiste, H. Zhang, Routing high-bandwidth traffic in max\u2013min fair share networks, ACM SIGCOMM, August 1996, pp. 206\u2013217","key":"10.1016\/S1389-1286(03)00290-1_BIB14","DOI":"10.1145\/248157.248175"},{"doi-asserted-by":"crossref","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(03)00290-1_BIB15","DOI":"10.1109\/INFCOM.2000.832263"},{"unstructured":"K. Kompella, D. Awduche, Notes on path computation in constraint-based routing, Internet Engineering Task Force, Internet Draft, September 2000, Work in Progress","key":"10.1016\/S1389-1286(03)00290-1_BIB16"},{"doi-asserted-by":"crossref","unstructured":"A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft, C. Diot, IGP link weight assignment for transient link failures, Sprint ATL Technical Report TR02-ATL071000, July 2002","key":"10.1016\/S1389-1286(03)00290-1_BIB17","DOI":"10.1016\/S1388-3437(03)80177-4"},{"unstructured":"D. Orincsay, J. Harmatos, On-demand optimization of protected LSP-tunnels in MPLS networks, IFIP 2001, Budapest, June 2001","key":"10.1016\/S1389-1286(03)00290-1_BIB18"},{"unstructured":"M. Pi\u00f3ro, P. Gajowniczek, Simulated allocation: a suboptimal solution to the multicommodity flow problems, in: 11th UK Teletraffic Symposium, 1994","key":"10.1016\/S1389-1286(03)00290-1_BIB19"},{"issue":"6","key":"10.1016\/S1389-1286(03)00290-1_BIB20","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/49.400667","article-title":"Competitive routing of virtual circuits in ATM networks","volume":"13","author":"Plotkin","year":"1995","journal-title":"IEEE Journal of Selected Areas in Communications"},{"unstructured":"A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, Wiley, London, 1986","key":"10.1016\/S1389-1286(03)00290-1_BIB21"},{"doi-asserted-by":"crossref","unstructured":"A. Shaikh, J. Rexford, K.G. Shin, Load-sensitive routing of long-lived IP flows, ACM SIGCOMM, 1999, pp. 215\u2013226","key":"10.1016\/S1389-1286(03)00290-1_BIB22","DOI":"10.1145\/316188.316225"},{"issue":"2","key":"10.1016\/S1389-1286(03)00290-1_BIB23","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/90.917073","article-title":"Evaluating the overheads of source-directed quality-of-service routing","volume":"9","author":"Shaikh","year":"2001","journal-title":"IEEE\/ACM Transactions on Networking"},{"unstructured":"B. Szviatovszki, \u00c1. Szentesi, A. J\u00fcttner, Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing, in: 2001 International Symposium of Performance Evaluation of Computer and Telecommunication Systems, 2001, pp. 249\u2013261","key":"10.1016\/S1389-1286(03)00290-1_BIB24"},{"unstructured":"D. Wang, Network planning and analysis tools for MPLS networks, Slide presentation given at the IW-MPLS\u201998 Conference, November 1998","key":"10.1016\/S1389-1286(03)00290-1_BIB25"},{"issue":"7","key":"10.1016\/S1389-1286(03)00290-1_BIB26","first-page":"1234","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002901?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603002901?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T18:45:40Z","timestamp":1734029140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603002901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1389128603002901"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00290-1","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}