{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:08Z","timestamp":1772163968748,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,16]],"date-time":"2009-08-16T00:00:00Z","timestamp":1250380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,8,16]]},"DOI":"10.1145\/1592568.1592596","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T10:08:35Z","timestamp":1251108515000},"page":"231-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":84,"title":["Towards automated performance diagnosis in a large IPTV network"],"prefix":"10.1145","author":[{"given":"Ajay Anil","family":"Mahimkar","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Zihui","family":"Ge","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}]},{"given":"Aman","family":"Shaikh","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}]},{"given":"Jia","family":"Wang","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}]},{"given":"Jennifer","family":"Yates","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Qi","family":"Zhao","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research, Florham Park, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,8,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281197"},{"key":"e_1_3_2_1_2_1","volume-title":"NSDI","author":"Aggarwal B.","year":"2009","unstructured":"B. Aggarwal , R. Bhagwan , V. N. Padmanabhan , and G. Voelker . NetPrints: Diagnosing home network misconfigurations using shared knowledge . In NSDI , 2009 . B. Aggarwal, R. Bhagwan, V. N. Padmanabhan, and G. Voelker. NetPrints: Diagnosing home network misconfigurations using shared knowledge. In NSDI, 2009."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281203"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282383"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/114098.114105"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452529"},{"key":"e_1_3_2_1_7_1","volume-title":"OSDI","author":"Chen X.","year":"2008","unstructured":"X. Chen , M. Zhang , Z. M. Mao , and P. Bahl . Automating network application dependency discovery: Experiences, limitations, and new solutions . In OSDI , 2008 . X. Chen, M. Zhang, Z. M. Mao, and P. Bahl. Automating network application dependency discovery: Experiences, limitations, and new solutions. In OSDI, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352592.1352605"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022649401552"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315492"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007588"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364677"},{"key":"e_1_3_2_1_15_1","volume-title":"For most large underdetermined systems of equations, the minimal l1-norm near solution approximates the sparsest near--solution. In http:\/\/www-stat.stanford.edu\/ donoho\/Reports\/","author":"Donoho D.L.","year":"2004","unstructured":"D.L. Donoho . For most large underdetermined systems of equations, the minimal l1-norm near solution approximates the sparsest near--solution. In http:\/\/www-stat.stanford.edu\/ donoho\/Reports\/ , 2004 . D.L.Donoho. For most large underdetermined systems of equations, the minimal l1-norm near solution approximates the sparsest near--solution. In http:\/\/www-stat.stanford.edu\/ donoho\/Reports\/, 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912791"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.907451"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1403001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402970"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080173.1080178"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.252"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544014"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555381"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368436.1368490"},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Statistics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2748-9","volume-title":"Causation, prediction and search","author":"Spirtes P.","year":"1993","unstructured":"P. Spirtes , C. N. Glymour , and R. Scheines . Causation, prediction and search . Lecture Notes in Statistics , 1993 . P. Spirtes, C. N. Glymour, and R. Scheines. Causation, prediction and search. Lecture Notes in Statistics, 1993."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.v13:1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402971"},{"key":"e_1_3_2_1_29_1","unstructured":"Wikipedia. Chebyshev inequality. http:\/\/en.wikipedia.org\/wiki\/Chebyshev's_inequality.  Wikipedia. Chebyshev inequality. http:\/\/en.wikipedia.org\/wiki\/Chebyshev's_inequality."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/35.492975"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218063.1217968"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028802"}],"event":{"name":"SIGCOMM '09: ACM SIGCOMM 2009 Conference","location":"Barcelona Spain","acronym":"SIGCOMM '09","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the ACM SIGCOMM 2009 conference on Data communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592568.1592596","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1592568.1592596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:17:48Z","timestamp":1750234668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592568.1592596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,16]]},"references-count":30,"alternative-id":["10.1145\/1592568.1592596","10.1145\/1592568"],"URL":"https:\/\/doi.org\/10.1145\/1592568.1592596","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1594977.1592596","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,8,16]]},"assertion":[{"value":"2009-08-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}