{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:06:52Z","timestamp":1775912812149,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012470","name":"CERN","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012470","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.9488908","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":19,"title":["Low Cost Sparse Network Monitoring Based on Block Matrix Completion"],"prefix":"10.1109","author":[{"given":"Kun","family":"Xie","sequence":"first","affiliation":[]},{"given":"Jiazheng","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Gaogang","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Guangxing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dafang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iax020"},{"key":"ref32","article-title":"Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions","author":"halko","year":"2009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911489"},{"key":"ref34","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Advances in neural information processing systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218633"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592600"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/JSAC.2006.884026","article-title":"Ides: An internet distance estimation service for large networks","volume":"24","author":"mao","year":"2006","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2228881"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524463"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057218"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2940147"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2976129"},{"key":"ref18","article-title":"Accurate and fast recovery of network monitoring data with gpuaccelerated tensor completion","author":"xie","year":"2020","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057117"},{"key":"ref28","article-title":"Coherent matrix completion","author":"chen","year":"2014","journal-title":"ACM ICML"},{"key":"ref4","first-page":"599","article-title":"Netbouncer: active device and link failure localization in data center networks","author":"tan","year":"2019","journal-title":"16th USENIX Symposium on Networked Systems Design and Implementation ( NSDI 19)"},{"key":"ref27","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1601280"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787496"},{"key":"ref29","first-page":"836","author":"krishnamurthy","year":"2013","journal-title":"Advances in Neural Information Processing Systems 26"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934884"},{"key":"ref8","article-title":"In-band network telemetry via programmable dataplanes","author":"kim","year":"2015","journal-title":"ACM SIGCOMM"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787483"},{"key":"ref9","article-title":"Netno-rad: Troubleshooting networks via end-to-end probing","author":"adams","year":"2017","journal-title":"Facebook White Paper"},{"key":"ref1","first-page":"55","article-title":"detector: a topologyaware monitoring system for data center networks","author":"peng","year":"2017","journal-title":"2017 USENIX Annual Technical Conference ( USENIX ATC 17)"},{"key":"ref20","first-page":"259265","article-title":"Expectile matrix factorization for skewed data analysis","author":"zhu","year":"2017","journal-title":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref24","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref26","article-title":"72hourPlanetLabpingtrace","year":"0"},{"key":"ref25","article-title":"The abilene observatory data collections","year":"0"}],"event":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications","location":"Vancouver, BC, Canada","start":{"date-parts":[[2021,5,10]]},"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\/09488908.pdf?arnumber=9488908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:43:38Z","timestamp":1652197418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9488908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/infocom42981.2021.9488908","relation":{},"subject":[],"published":{"date-parts":[[2021,5,10]]}}}