{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:13:42Z","timestamp":1766067222566},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/icccn49398.2020.9209641","type":"proceedings-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T20:59:41Z","timestamp":1601499581000},"source":"Crossref","is-referenced-by-count":5,"title":["Adaptive and Low-cost Traffic Engineering based on Traffic Matrix Classification"],"prefix":"10.1109","author":[{"given":"Nan","family":"Geng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enhuan","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref31","article-title":"Abilene","year":"0"},{"key":"ref30","article-title":"scikit-learn","year":"2019"},{"key":"ref35","article-title":"Netflow","year":"2018"},{"key":"ref34","article-title":"Mininet","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8705(03)00043-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/568574.568575"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893227"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref14","article-title":"Caida","year":"2019"},{"key":"ref15","article-title":"Ryu","year":"2018"},{"key":"ref16","article-title":"Openflow v1.3","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2008.1081"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2019.00039"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3229607.3229610"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2014.6900880"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143865"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486419"},{"key":"ref27","article-title":"Random forests","author":"breiman","year":"2001","journal-title":"Machine Learning"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"ref5","article-title":"Learning to route with deep RL","author":"valadarsky","year":"2017","journal-title":"NIPS"},{"key":"ref29","article-title":"A study of cross-validation and bootstrap for accuracy estimation and model selection","author":"kohavi","year":"1995","journal-title":"IJCAI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.927257"},{"key":"ref2","article-title":"Semi-oblivious traffic engineering: The road not taken","author":"kumar","year":"2018","journal-title":"USENIX NSDI"},{"key":"ref9","article-title":"On optimal routing with multiple traffic matrices","author":"zhang","year":"2005","journal-title":"INFOCOM"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886296"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3314148.3314357"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2709742"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/35.809383"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-017-0479-6"},{"key":"ref25","article-title":"Gini coefficient","year":"2020"}],"event":{"name":"2020 29th International Conference on Computer Communications and Networks (ICCCN)","location":"Honolulu, HI, USA","start":{"date-parts":[[2020,8,3]]},"end":{"date-parts":[[2020,8,6]]}},"container-title":["2020 29th International Conference on Computer Communications and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9205796\/9209588\/09209641.pdf?arnumber=9209641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:16:11Z","timestamp":1656375371000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9209641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icccn49398.2020.9209641","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}