{"id":"https://openalex.org/W2963578178","doi":"https://doi.org/10.1109/tnet.2019.2921589","title":"Node-Constrained Traffic Engineering: Theory and Applications","display_name":"Node-Constrained Traffic Engineering: Theory and Applications","publication_year":2019,"publication_date":"2019-06-26","ids":{"openalex":"https://openalex.org/W2963578178","doi":"https://doi.org/10.1109/tnet.2019.2921589","mag":"2963578178"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2019.2921589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2921589","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","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/A5015688294","display_name":"George Trimponias","orcid":"https://orcid.org/0000-0001-8119-1811"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"George Trimponias","raw_affiliation_strings":["Huawei Noah\u2019s Ark Lab, Hong Kong","Huawei Noah's Ark Lab, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Huawei Noah\u2019s Ark Lab, Hong Kong","institution_ids":["https://openalex.org/I2250955327"]},{"raw_affiliation_string":"Huawei Noah's Ark Lab, Hong Kong","institution_ids":["https://openalex.org/I2250955327"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027255721","display_name":"Yan Xiao","orcid":"https://orcid.org/0000-0002-2563-083X"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yan Xiao","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038164702","display_name":"Xiaorui Wu","orcid":"https://orcid.org/0000-0003-2632-1569"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaorui Wu","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022420830","display_name":"Hong Xu","orcid":"https://orcid.org/0000-0002-9359-9571"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Hong Xu","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031518540","display_name":"Yanhui Geng","orcid":"https://orcid.org/0000-0001-6326-1222"},"institutions":[{"id":"https://openalex.org/I4210115038","display_name":"Huawei Technologies (Canada)","ror":"https://ror.org/026venb53","country_code":"CA","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210115038"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yanhui Geng","raw_affiliation_strings":["Huawei Montreal Research Center, Montreal, QC, Canada"],"affiliations":[{"raw_affiliation_string":"Huawei Montreal Research Center, Montreal, QC, Canada","institution_ids":["https://openalex.org/I4210115038"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5015688294"],"corresponding_institution_ids":["https://openalex.org/I2250955327"],"apc_list":null,"apc_paid":null,"fwci":4.0778,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.94460827,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"27","issue":"4","first_page":"1344","last_page":"1358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9988999962806702,"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.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6868404150009155},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6289094686508179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6106006503105164},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5097734332084656},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49191808700561523},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.4870145916938782},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4773671329021454},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4672275483608246},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4440646469593048},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.42577916383743286},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42220380902290344},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4132174849510193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3702716827392578},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.344357967376709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2989572584629059},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22167828679084778},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20999115705490112},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18816429376602173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13906022906303406}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6868404150009155},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6289094686508179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6106006503105164},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5097734332084656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49191808700561523},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.4870145916938782},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4773671329021454},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4672275483608246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4440646469593048},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.42577916383743286},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42220380902290344},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4132174849510193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3702716827392578},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.344357967376709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2989572584629059},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22167828679084778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20999115705490112},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18816429376602173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13906022906303406},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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":[{"id":"doi:10.1109/tnet.2019.2921589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2019.2921589","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G7863355050","display_name":null,"funder_award_id":"9231208","funder_id":"https://openalex.org/F4320322170","funder_display_name":"University of Hong Kong"}],"funders":[{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1505653851","https://openalex.org/W1545430305","https://openalex.org/W1651984967","https://openalex.org/W1680189815","https://openalex.org/W1728954886","https://openalex.org/W1875112053","https://openalex.org/W1966469677","https://openalex.org/W1971937094","https://openalex.org/W1977545325","https://openalex.org/W2006146932","https://openalex.org/W2033040247","https://openalex.org/W2045426033","https://openalex.org/W2047714188","https://openalex.org/W2053913299","https://openalex.org/W2055438560","https://openalex.org/W2056944867","https://openalex.org/W2076185696","https://openalex.org/W2087194317","https://openalex.org/W2089370556","https://openalex.org/W2096655151","https://openalex.org/W2097906305","https://openalex.org/W2102090846","https://openalex.org/W2103985627","https://openalex.org/W2105785546","https://openalex.org/W2109015671","https://openalex.org/W2110722699","https://openalex.org/W2126482901","https://openalex.org/W2126822952","https://openalex.org/W2143508387","https://openalex.org/W2143996311","https://openalex.org/W2145858411","https://openalex.org/W2151715608","https://openalex.org/W2171590707","https://openalex.org/W2171707538","https://openalex.org/W2260686010","https://openalex.org/W2288595689","https://openalex.org/W2292669715","https://openalex.org/W2467997261","https://openalex.org/W2493944851","https://openalex.org/W2521104974","https://openalex.org/W2569646339","https://openalex.org/W2611147814","https://openalex.org/W2758462134","https://openalex.org/W2988480584","https://openalex.org/W3214428327","https://openalex.org/W4238452917","https://openalex.org/W4241999312","https://openalex.org/W4247540870","https://openalex.org/W6676079207"],"related_works":["https://openalex.org/W4206383867","https://openalex.org/W2923536170","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858"],"abstract_inverted_index":{"Traffic":[0],"engineering":[1],"(TE)":[2],"is":[3,103,224],"a":[4,38,73,115,125,151,217,232],"fundamental":[5],"task":[6],"in":[7,43,57,146,205,250],"networking.":[8],"Conventionally,":[9],"traffic":[10,69,92],"can":[11,142,177],"take":[12,94],"any":[13,95],"path":[14,96],"connecting":[15],"the":[16,47,62,68,85,91,119,140,169,175,201,243,246],"source":[17],"and":[18,77,137,211,220,239],"destination.":[19],"Emerging":[20],"technologies":[21],"such":[22],"as":[23,216],"segment":[24],"routing,":[25],"however,":[26],"use":[27],"logical":[28],"paths":[29,35,134,171],"that":[30,84,89,130,139,222],"are":[31,192],"composed":[32],"of":[33,41,51,64,75,127,154,183,236,245],"shortest":[34,133],"going":[36,97],"through":[37,72,98],"predetermined":[39],"set":[40,74],"middlepoints":[42,102],"order":[44],"to":[45,93,172,194],"reduce":[46],"flow":[48,187,214],"table":[49],"overhead":[50],"TE":[52,88,129,238,249],"implementation.":[53],"Inspired":[54],"by":[55],"this,":[56],"this":[58,163],"paper,":[59],"we":[60,167,191,199],"introduce":[61,210],"problem":[63,141,176,204],"node-constrained":[65,87,128,207,237,248],"TE,":[66],"where":[67],"must":[70],"go":[71],"middlepoints,":[76,136,155],"study":[78,212],"its":[79],"theoretical":[80,234],"fundamentals.":[81],"We":[82,122,209],"show":[83,221],"general":[86,206],"allows":[90],"one":[99],"or":[100],"more":[101],"NP-hard":[104],"for":[105,111,150,189],"directed":[106],"graphs":[107],"but":[108,226],"strongly":[109],"polynomial":[110,148],"undirected":[112],"graphs,":[113],"unveiling":[114],"profound":[116],"dichotomy":[117],"between":[118,135],"two":[120],"cases.":[121],"also":[123],"investigate":[124,200],"variant":[126],"uses":[131],"only":[132],"prove":[138],"now":[143],"be":[144,173],"solved":[145],"weakly":[147],"time":[149],"fixed":[152],"number":[153],"which":[156,190],"explains":[157],"why":[158],"existing":[159],"work":[160,185,230],"focuses":[161],"on":[162,242],"variant.":[164],"Yet,":[165],"if":[166],"constrain":[168],"end-to-end":[170],"acyclic,":[174],"become":[178],"NP-hard.":[179],"An":[180],"important":[181],"application":[182],"our":[184],"concerns":[186],"centrality,":[188],"able":[193],"derive":[195],"complexity":[196],"results.":[197],"Furthermore,":[198],"middlepoint":[202],"selection":[203],"TE.":[208],"group":[213],"centrality":[215],"solution":[218],"concept,":[219],"it":[223],"monotone":[225],"not":[227],"submodular.":[228],"Our":[229],"provides":[231],"thorough":[233],"treatment":[235],"sheds":[240],"light":[241],"development":[244],"emerging":[247],"practice.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}