{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:17:44Z","timestamp":1774311464393,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003803","name":"University of Hong Kong","doi-asserted-by":"publisher","award":["9231208"],"award-info":[{"award-number":["9231208"]}],"id":[{"id":"10.13039\/501100003803","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CRF Grant from the Research Grants Council of the HKSAR, China","award":["C7036-15G"],"award-info":[{"award-number":["C7036-15G"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tnet.2019.2921589","type":"journal-article","created":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T19:58:06Z","timestamp":1561579086000},"page":"1344-1358","source":"Crossref","is-referenced-by-count":29,"title":["Node-Constrained Traffic Engineering: Theory and Applications"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8119-1811","authenticated-orcid":false,"given":"George","family":"Trimponias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2632-1569","authenticated-orcid":false,"given":"Xiaorui","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9359-9571","authenticated-orcid":false,"given":"Hong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6326-1222","authenticated-orcid":false,"given":"Yanhui","family":"Geng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_8"},{"key":"ref33","author":"kurose","year":"2016","journal-title":"Computer Networking A Top-down Approach"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(80)90061-0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2875951.2875956"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"ref35","first-page":"333","article-title":"Panopticon: Reaping the benefits of incremental SDN deployment in enterprise networks","author":"levin","year":"2014","journal-title":"Proc USENIX ATC"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90057-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916625"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.21"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2559899.2560327"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref15","first-page":"2","article-title":"Segment routing with MPLS data plane","author":"filsfils","year":"2014","journal-title":"Proc Internet Eng Task Force Internet Draft (Work Prog )"},{"key":"ref16","author":"filsfils","year":"2014","journal-title":"Segment Routing Use Cases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417124"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070602"},{"key":"ref3","article-title":"The directed disjoint shortest paths problem","author":"b\u00e9rczi","year":"2016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.07.019"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46922-5_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524410"},{"key":"ref1","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00121-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(91)90017-N"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159926"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417097"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1108\/10662240910927821"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.131208"},{"key":"ref41","author":"papadimitriou","year":"1982","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787495"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_41"},{"key":"ref43","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8804282\/08746240.pdf?arnumber=8746240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:52Z","timestamp":1657746892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8746240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2019.2921589","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}