乐胖代购免代理版

{"id":"https://openalex.org/W2096803077","doi":"https://doi.org/10.1109/icc.2003.1203941","title":"Multi-path constraint-based routing algorithms for MPLS traffic engineering","display_name":"Multi-path constraint-based routing algorithms for MPLS traffic engineering","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2096803077","doi":"https://doi.org/10.1109/icc.2003.1203941","mag":"2096803077"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1203941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5008935042","display_name":"H Cho","orcid":null},"institutions":[{"id":"https://openalex.org/I196345858","display_name":"Chungnam National University","ror":"https://ror.org/0227as991","country_code":"KR","type":"education","lineage":["https://openalex.org/I196345858"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"None Ho Young Cho","raw_affiliation_strings":["Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea","institution_ids":["https://openalex.org/I196345858"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100369464","display_name":"Jae Yong Lee","orcid":"https://orcid.org/0000-0002-4967-911X"},"institutions":[{"id":"https://openalex.org/I196345858","display_name":"Chungnam National University","ror":"https://ror.org/0227as991","country_code":"KR","type":"education","lineage":["https://openalex.org/I196345858"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"None Jae Yong Lee","raw_affiliation_strings":["Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea","institution_ids":["https://openalex.org/I196345858"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100710789","display_name":"Byung Chul Kim","orcid":"https://orcid.org/0000-0001-7073-5318"},"institutions":[{"id":"https://openalex.org/I196345858","display_name":"Chungnam National University","ror":"https://ror.org/0227as991","country_code":"KR","type":"education","lineage":["https://openalex.org/I196345858"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"None Byung Chul Kim","raw_affiliation_strings":["Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Dept. of Information & Commun. Eng., Chung Nam Nat. Univ., Daejeon, South Korea","institution_ids":["https://openalex.org/I196345858"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.786,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":17,"citation_normalized_percentile":{"value":0.886154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9999,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9999,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9997,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9973,"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/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.69442225},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5947729},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.43753457}],"concepts":[{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.82532346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.74257123},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.69442225},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6938262},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.63193685},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5986541},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5947729},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.576354},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5734276},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.51660335},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.49621946},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4501776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4436362},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.43753457},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41769636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40147856},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.38538438},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.37376243},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.21877256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1494978},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12798595},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.12708163},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12648097},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1203941","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1485595694","https://openalex.org/W1532363302","https://openalex.org/W1636629214","https://openalex.org/W1651117873","https://openalex.org/W2047553334","https://openalex.org/W2097906305","https://openalex.org/W2105676563","https://openalex.org/W2126024460","https://openalex.org/W2169528473","https://openalex.org/W2248064281","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W768680197","https://openalex.org/W2962525871","https://openalex.org/W2889457051","https://openalex.org/W2186932829","https://openalex.org/W2154023691","https://openalex.org/W2121598558","https://openalex.org/W2064711473","https://openalex.org/W1997440971","https://openalex.org/W1972487624","https://openalex.org/W1971025399"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"two":[3,63],"multi-path":[4],"constraint-based":[5,17],"routing":[6,22],"algorithms":[7,56],"for":[8,38,51,72],"Internet":[9],"traffic":[10,52],"engineering":[11],"using":[12],"MPLS.":[13],"In":[14],"a":[15,26,33,39,69],"normal":[16],"shortest":[18],"path":[19,35,71,85],"first":[20],"(CSPF)":[21],"algorithm,":[23],"there":[24],"is":[25,44],"high":[27],"probability":[28,83],"that":[29,78],"it":[30],"cannot":[31],"find":[32,68],"feasible":[34],"through":[36],"networks":[37],"large":[40],"bandwidth":[41,60],"constraint,":[42],"which":[43],"one":[45],"of":[46,84,90],"the":[47,59,81,88],"most":[48],"important":[49],"constraints":[50],"engineering.":[53],"The":[54],"proposed":[55],"can":[57],"divide":[58],"constraint":[61],"into":[62],"or":[64],"more":[65],"seconds":[66],"and":[67,87],"constrained":[70],"each":[73],"subconstraint.":[74],"Extensive":[75],"simulations":[76],"show":[77],"they":[79],"enhance":[80],"success":[82],"setup":[86],"utilization":[89],"network":[91],"resources.":[92]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2096803077","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-08T01:00:19.990333","created_date":"2016-06-24"}