{"id":"https://openalex.org/W2070251290","doi":"https://doi.org/10.1016/s1389-1286(03)00290-1","title":"Prompt partial path optimization in MPLS networks","display_name":"Prompt partial path optimization in MPLS networks","publication_year":2003,"publication_date":"2003-05-27","ids":{"openalex":"https://openalex.org/W2070251290","doi":"https://doi.org/10.1016/s1389-1286(03)00290-1","mag":"2070251290"},"language":"en","primary_location":{"id":"doi:10.1016/s1389-1286(03)00290-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1389-1286(03)00290-1","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026201951","display_name":"D. Orincsay","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131589","display_name":"Ericsson (Hungary)","ror":"https://ror.org/03c0yyz21","country_code":"HU","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210131589"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Orincsay","raw_affiliation_strings":["Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#","institution_ids":["https://openalex.org/I4210131589"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025988716","display_name":"Bal\u00e1zs Szviatovszki","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131589","display_name":"Ericsson (Hungary)","ror":"https://ror.org/03c0yyz21","country_code":"HU","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210131589"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Bal\u00e1zs Szviatovszki","raw_affiliation_strings":["Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#","institution_ids":["https://openalex.org/I4210131589"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055044487","display_name":"G\u00e9za B\u00f6hm","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131589","display_name":"Ericsson (Hungary)","ror":"https://ror.org/03c0yyz21","country_code":"HU","type":"company","lineage":["https://openalex.org/I1306339040","https://openalex.org/I4210131589"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e9za B\u00f6hm","raw_affiliation_strings":["Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#"],"affiliations":[{"raw_affiliation_string":"Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, 1300 Budapest, Hungary#TAB#","institution_ids":["https://openalex.org/I4210131589"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026201951"],"corresponding_institution_ids":["https://openalex.org/I4210131589"],"apc_list":{"value":2370,"currency":"USD","value_usd":2370},"apc_paid":null,"fwci":0.3525,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63275868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"43","issue":"5","first_page":"557","last_page":"572"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.915306568145752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.868779718875885},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.727696418762207},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6523532271385193},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6061779260635376},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5779927968978882},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5654916167259216},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5654201507568359},{"id":"https://openalex.org/keywords/path-protection","display_name":"Path protection","score":0.5418745279312134},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5272226333618164},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5269152522087097},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5083677172660828},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4886191487312317},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4861614406108856},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4617052674293518},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44104236364364624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3410717844963074},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.24163737893104553},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23682895302772522},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2266983985900879},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11852210760116577},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10689187049865723},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10476243495941162},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08740434050559998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08200976252555847}],"concepts":[{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.915306568145752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.868779718875885},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.727696418762207},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6523532271385193},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6061779260635376},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5779927968978882},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5654916167259216},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5654201507568359},{"id":"https://openalex.org/C2781040381","wikidata":"https://www.wikidata.org/wiki/Q17105208","display_name":"Path protection","level":4,"score":0.5418745279312134},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5272226333618164},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5269152522087097},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5083677172660828},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4886191487312317},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4861614406108856},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4617052674293518},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44104236364364624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3410717844963074},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.24163737893104553},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23682895302772522},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2266983985900879},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11852210760116577},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10689187049865723},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10476243495941162},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08740434050559998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08200976252555847},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C160724564","wikidata":"https://www.wikidata.org/wiki/Q1620670","display_name":"Wavelength-division multiplexing","level":3,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C49040817","wikidata":"https://www.wikidata.org/wiki/Q193091","display_name":"Optoelectronics","level":1,"score":0.0},{"id":"https://openalex.org/C6260449","wikidata":"https://www.wikidata.org/wiki/Q41364","display_name":"Wavelength","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1389-1286(03)00290-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1389-1286(03)00290-1","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W285818718","https://openalex.org/W1582342575","https://openalex.org/W1963547452","https://openalex.org/W1972926899","https://openalex.org/W1985282803","https://openalex.org/W1987300875","https://openalex.org/W2027920448","https://openalex.org/W2040634542","https://openalex.org/W2065173252","https://openalex.org/W2096655151","https://openalex.org/W2096774592","https://openalex.org/W2096909875","https://openalex.org/W2111010037","https://openalex.org/W2156216151","https://openalex.org/W2156927647","https://openalex.org/W2172151912","https://openalex.org/W2243986870","https://openalex.org/W2914162397","https://openalex.org/W3161194055","https://openalex.org/W6674847561"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1997440971","https://openalex.org/W2962525871","https://openalex.org/W2064711473","https://openalex.org/W189149726","https://openalex.org/W1515277195","https://openalex.org/W1972487624","https://openalex.org/W2009987517","https://openalex.org/W2186932829","https://openalex.org/W2170980056"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}