{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:12Z","timestamp":1772163912979,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":[[2004,6]]},"DOI":"10.1145\/1005686.1005696","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T11:55:38Z","timestamp":1090324538000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Flow classification by histograms"],"prefix":"10.1145","author":[{"given":"Augustin","family":"Soule","sequence":"first","affiliation":[{"name":"University of Paris VI"}]},{"given":"Kav\u00e9","family":"Salamatia","sequence":"additional","affiliation":[{"name":"University of Paris VI"}]},{"given":"Nina","family":"Taft","sequence":"additional","affiliation":[{"name":"Intel Berkeley"}]},{"given":"Richard","family":"Emilion","sequence":"additional","affiliation":[{"name":"University of Orl\u00e9ans"}]},{"given":"Konstantina","family":"Papagiannaki","sequence":"additional","affiliation":[{"name":"Intel Cambridge"}]}],"member":"320","published-online":{"date-parts":[[2004,6]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039865"},{"key":"e_1_3_2_1_4_1","volume-title":"Maximum likelihood from incomplete data via the EM algorithm. 39:1--38","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster , N. M. Laird , and D. B. Rubin . Maximum likelihood from incomplete data via the EM algorithm. 39:1--38 , 1977 . A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. 39:1--38, 1977."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1994.10476468"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1995.10476550"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505212"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1631-073X(02)02432-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005697"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/83.1.67"},{"key":"e_1_3_2_1_12_1","volume-title":"IEEE Infocom","author":"Papagiannaki K.","year":"2004","unstructured":"K. Papagiannaki , N. Taft , and C. Diot . Impact of flow dynamics on traffic engineering design principles . In IEEE Infocom , Hong Kong , March 2004 . K. Papagiannaki, N. Taft, and C. Diot. Impact of flow dynamics on traffic engineering design principles. In IEEE Infocom, Hong Kong, March 2004."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. ACM SIGCOMM, september","author":"Rexford S. Sarvotham J.","year":"1999","unstructured":"S. Sarvotham J. Rexford and K. Shin . Load-sensitive routing of ling-lived ip ows . In Proc. ACM SIGCOMM, september 1999 . S. Sarvotham J. Rexford and K.Shin. Load-sensitive routing of ling-lived ip ows. In Proc. ACM SIGCOMM, september 1999."},{"key":"e_1_3_2_1_14_1","volume-title":"The Bayesian Choice","author":"Robert Christian P.","year":"2001","unstructured":"Christian P. Robert . The Bayesian Choice . Springer , 2001 . Christian P. Robert. The Bayesian Choice. Springer, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378439"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505215"},{"key":"e_1_3_2_1_17_1","volume-title":"BGP Building Reliable Networks with the Border Gateway Protocol. O'Reilly","author":"van Beijnum Iljitsch","year":"2002","unstructured":"Iljitsch van Beijnum . BGP Building Reliable Networks with the Border Gateway Protocol. O'Reilly , 2002 . Iljitsch van Beijnum. BGP Building Reliable Networks with the Border Gateway Protocol. O'Reilly, 2002."}],"event":{"name":"SIGMETRICS04: SIGMETRICS 2004 \/ PERFORMANCE 2004","location":"New York NY USA","acronym":"SIGMETRICS04","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the joint international conference on Measurement and modeling of computer systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005686.1005696","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1005686.1005696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:24:39Z","timestamp":1750249479000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1005686.1005696"}},"subtitle":["or how to go on safari in the internet"],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":14,"alternative-id":["10.1145\/1005686.1005696","10.1145\/1005686"],"URL":"https:\/\/doi.org\/10.1145\/1005686.1005696","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1012888.1005696","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,6]]},"assertion":[{"value":"2004-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}