{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:31:46Z","timestamp":1762507906530,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2951163","type":"journal-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T04:45:53Z","timestamp":1572929153000},"page":"160408-160417","source":"Crossref","is-referenced-by-count":10,"title":["A Computation-Efficient Approach for Segment Routing Traffic Engineering"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8488-5165","authenticated-orcid":false,"given":"Tossaphol","family":"Settawatcharawanit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2850-3120","authenticated-orcid":false,"given":"Yi-Han","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusheng","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"GLPK (GNU Linear Programming Kit)","year":"2008","author":"makhorin","key":"ref33"},{"journal-title":"Gurobi","year":"2019","key":"ref32"},{"journal-title":"IBM ILOG CPLEX Optimization Studio","year":"2014","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref35","article-title":"REPETITA: Repeatable experiments for performance evaluation of traffic-engineering algorithms","author":"gay","year":"2017","journal-title":"arXiv 1710 08665"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2731419"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2854610"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8762075"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2018.8638085"},{"article-title":"On traffic engineering with segment routing in SDN based WANs","year":"2017","author":"trimponias","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2921589"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCChinaW.2018.8674481"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3291842.3291914"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2826925"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062093"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2014.6914307"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848027"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2702"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/35.809383"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00157-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924672"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056971"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787495"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.17487\/RFC8666","article-title":"OSPFv3 extensions for segment routing","author":"psenak","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2017.49"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2017.8264828"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08890665.pdf?arnumber=8890665","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T02:07:07Z","timestamp":1643162827000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8890665\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2951163","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}