{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:27:27Z","timestamp":1772908047639,"version":"3.50.1"},"reference-count":54,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002019"],"award-info":[{"award-number":["62002019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,10]]},"DOI":"10.1109\/icnp59255.2023.10355645","type":"proceedings-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T19:18:50Z","timestamp":1703099930000},"page":"1-11","source":"Crossref","is-referenced-by-count":5,"title":["Roracle: Enabling Lookahead Routing for Scalable Traffic Engineering with Supervised Learning"],"prefix":"10.1109","author":[{"given":"Minghao","family":"Ye","sequence":"first","affiliation":[{"name":"New York University"}]},{"given":"Junjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"Fortinet, Inc"}]},{"given":"Zehua","family":"Guo","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}]},{"given":"H. Jonathan","family":"Chao","sequence":"additional","affiliation":[{"name":"New York University"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2906743"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2348176"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2008.2006219"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.10102"},{"key":"ref6","first-page":"157","article-title":"Semi-oblivious traffic engineering: The road not taken","author":"Kumar","journal-title":"USENIX NSDI18"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-105-9_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/icccn.1999.805577"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM.2017.8256021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3402413.3402416"},{"key":"ref11","first-page":"175","article-title":"Contracting wide-area network topologies to solve flow problems quickly","author":"Abuzaid","journal-title":"USENIX NSDI21"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2018.8406199"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS49365.2020.9213008"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC47284.2019.8969631"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2018.8473978"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/iske.2017.8258815"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374415"},{"key":"ref19","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2018","journal-title":"arXiv preprint"},{"key":"ref20","article-title":"Graph attention networks","author":"Velickovic","year":"2018","journal-title":"ar Xiv p rep rint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.830281"},{"key":"ref22","volume-title":"SNDlib"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.20371"},{"key":"ref24","article-title":"Continuous control with deep reinforcement learning","author":"Lillicrap","year":"2015","journal-title":"arXiv preprint"},{"key":"ref25","first-page":"1889","article-title":"Trust region policy optimization","author":"Schulman","journal-title":"ICML15"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152441"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056992"},{"key":"ref30","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018","journal-title":"arXiv preprint"},{"key":"ref31","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref34","article-title":"Layer normalization","author":"Ba","year":"2016","journal-title":"arXiv preprint"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2631438"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref38","volume-title":"GEANT. The TOTEM project"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP52444.2021.9651918"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35289-8_5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2001.948886"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787471"},{"key":"ref44","volume-title":"TMgen: Traffic Matrix Generation Tool"},{"issue":"56","key":"ref45","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from over-fitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref46","first-page":"950","article-title":"A simple weight decay can improve generalization","author":"Krogh","journal-title":"NIPS91"},{"key":"ref47","article-title":"Multipath Issues in Unicast and Multicast Next_Hop Selection","author":"Thaler","year":"2000","journal-title":"IETF RFC 2991"},{"key":"ref48","volume-title":"Gurobi"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2003.1208953"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2328"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1142"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567024"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2014.90"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2014.6914307"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-4012"}],"event":{"name":"2023 IEEE 31st International Conference on Network Protocols (ICNP)","location":"Reykjavik, Iceland","start":{"date-parts":[[2023,10,10]]},"end":{"date-parts":[[2023,10,13]]}},"container-title":["2023 IEEE 31st International Conference on Network Protocols (ICNP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10355566\/10355569\/10355645.pdf?arnumber=10355645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T20:15:29Z","timestamp":1705090529000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10355645\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,10]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/icnp59255.2023.10355645","relation":{},"subject":[],"published":{"date-parts":[[2023,10,10]]}}}