{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:08:14Z","timestamp":1740100094944,"version":"3.37.3"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,10]]},"DOI":"10.1109\/infocom42981.2021.9488691","type":"proceedings-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:07:32Z","timestamp":1627344452000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Bound Inference and Reinforcement Learning-based Path Construction in Bandwidth Tomography"],"prefix":"10.1109","author":[{"given":"Cuiying","family":"Feng","sequence":"first","affiliation":[{"name":"University of Victoria,Department of Computer Science,Victoria,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"An","sequence":"additional","affiliation":[{"name":"University of Victoria,Department of Computer Science,Victoria,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kui","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Victoria,Department of Computer Science,Victoria,Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Wang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2969523"},{"key":"ref11","article-title":"Network tomography using min-plus system theory","author":"rizk","year":"2008","journal-title":"Master’s thesis"},{"key":"ref12","first-page":"53","article-title":"On the identifiability of link service curves from end-host measurements","author":"rizk","year":"2008","journal-title":"International Conference on Network Control and Optimization"},{"key":"ref13","article-title":"Synchronization and linearity - an algebra for discrete event systems","volume":"45","author":"baccelli","year":"1994","journal-title":"The Journal of the Operational Research Society"},{"key":"ref14","volume":"2050","author":"le boudec","year":"2001","journal-title":"Network Calculus A Theory of Deterministic Queuing Systems for the Internet"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref16","article-title":"Pathload: A measurement tool for end-to-end available bandwidth","author":"jain","year":"2002","journal-title":"Proceedings of Passive and Active Measurements (PAM) workshop"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.24"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737420"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2504730.2504738"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848079"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2581176"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2411691"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2328668"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2985908"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486423"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347557"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-015-2459-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/9781860948886_0016"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015474"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2291416"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884022"},{"article-title":"Rocketfuel: An ISP topology mapping engine","year":"2002","author":"spring","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882907"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2291208"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2174648"}],"event":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","start":{"date-parts":[[2021,5,10]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2021,5,13]]}},"container-title":["IEEE INFOCOM 2021 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9488422\/9488423\/09488691.pdf?arnumber=9488691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:14:44Z","timestamp":1659482084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488691\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom42981.2021.9488691","relation":{},"subject":[],"published":{"date-parts":[[2021,5,10]]}}}