{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:39Z","timestamp":1772163999887,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T00:00:00Z","timestamp":1188172800000},"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":[[2007,8,27]]},"DOI":"10.1145\/1282380.1282392","type":"proceedings-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T11:35:23Z","timestamp":1349955323000},"page":"97-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["ProgME"],"prefix":"10.1145","author":[{"given":"Lihua","family":"Yuan","sequence":"first","affiliation":[{"name":"University of California: Davis, Davis, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Nee","family":"Chuah","sequence":"additional","affiliation":[{"name":"University of California: Davis, Davis, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasant","family":"Mohapatra","sequence":"additional","affiliation":[{"name":"University of California: Davis, Davis, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2006.255101"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065209"},{"key":"e_1_3_2_1_3_1","unstructured":"H. R. Andersen. An introduction to binary decision diagrams. http:\/\/www.it.dtu.dk\/~hra 1998.  H. R. Andersen. An introduction to binary decision diagrams. http:\/\/www.it.dtu.dk\/~hra 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208658"},{"key":"e_1_3_2_1_5_1","first-page":"2123","author":"Brownlee N.","year":"1997","unstructured":"N. Brownlee . Traffic Flow Measurement : Experiences with NeTraMet. RFC 2123 , 1997 . N. Brownlee. Traffic Flow Measurement: Experiences with NeTraMet. RFC 2123, 1997.","journal-title":"Experiences with NeTraMet. RFC"},{"key":"e_1_3_2_1_6_1","first-page":"2722","author":"Brownlee N.","year":"1999","unstructured":"N. Brownlee , C. Mills , and G. Ruth . Traffic Flow Measurement: Architecture. RFC 2722 , 1999 . N. Brownlee, C. Mills, and G. Ruth. Traffic Flow Measurement: Architecture. RFC 2722, 1999.","journal-title":"Traffic Flow Measurement: Architecture. RFC"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646462.693721"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948228"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005699"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846400"},{"key":"e_1_3_2_1_12_1","volume-title":"Symposium on Discrete Algorithms","author":"Eppstein D.","year":"2001","unstructured":"D. Eppstein and S. Muthukrishnan . Internet packet filter management and rectangle geometry . In Symposium on Discrete Algorithms , 2001 . D. Eppstein and S. Muthukrishnan. Internet packet filter management and rectangle geometry. In Symposium on Discrete Algorithms, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015495"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863972"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347554"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832493"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1128817.1128867"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005707"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. IEEE INFOCOM","author":"Hao F.","year":"2005","unstructured":"F. Hao , M. S. Kodialam , T. V. Lakshman , and H. Zhang . Fast, memory-efficient traffic estimation by coincidence counting . In Proc. IEEE INFOCOM , 2005 . F. Hao, M. S. Kodialam, T. V. Lakshman, and H. Zhang. Fast, memory-efficient traffic estimation by coincidence counting. In Proc. IEEE INFOCOM, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647881.737947"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/942808.943991"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301325"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354591"},{"key":"e_1_3_2_1_26_1","unstructured":"J. Lind-Nielsen. BuDDy version 2.4. http:\/\/sourceforge.net\/projects\/buddy 2004.  J. Lind-Nielsen. BuDDy version 2.4. http:\/\/sourceforge.net\/projects\/buddy 2004."},{"key":"e_1_3_2_1_27_1","first-page":"3176","author":"Phaal P.","year":"2001","unstructured":"P. Phaal , S. Panchen , and N. McKee. InMon Corporation 's sFlow : A Method for Monitoring Traffic in Switched and Routed Networks. RFC 3176 , 2001 . P. Phaal, S. Panchen, and N. McKee. InMon Corporation's sFlow: A Method for Monitoring Traffic in Switched and Routed Networks. RFC 3176, 2001.","journal-title":"RFC"},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. USENIX LISA","author":"Plonka D.","year":"2000","unstructured":"D. Plonka . FlowScan : A network traffic flow reporting and visualization tool . In Proc. USENIX LISA , 2000 . D. Plonka. FlowScan: A network traffic flow reporting and visualization tool. In Proc. USENIX LISA, 2000."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Team Cymru. The Team Cymru Bogon List v3.4. http:\/\/www.cymru.com\/Documents\/bogon-list.html Jan 2007.  Team Cymru. The Team Cymru Bogon List v3.4. http:\/\/www.cymru.com\/Documents\/bogon-list.html Jan 2007.","DOI":"10.1145\/1180176.1180190"},{"key":"e_1_3_2_1_30_1","unstructured":"A. Wald. Sequential Analysis. John Wiley & Sons 1947.  A. Wald. Sequential Analysis. John Wiley & Sons 1947."},{"key":"e_1_3_2_1_31_1","unstructured":"AS names.http:\/\/bgp.potaroo.net\/cidr\/autnums.html.  AS names.http:\/\/bgp.potaroo.net\/cidr\/autnums.html."},{"key":"e_1_3_2_1_32_1","unstructured":"Autofocus. http:\/\/ial.ucsd.edu\/AutoFocus\/.  Autofocus. http:\/\/ial.ucsd.edu\/AutoFocus\/."},{"key":"e_1_3_2_1_33_1","unstructured":"CAIDA\n  : Cooperative Association for Internet Data Analysis. http:\/\/www.caida.org\/home\/.  CAIDA: Cooperative Association for Internet Data Analysis. http:\/\/www.caida.org\/home\/."},{"key":"e_1_3_2_1_34_1","volume-title":"Jan","author":"CIDR","year":"2007","unstructured":"CIDR report. http:\/\/www.cidr-report.org\/ , Jan 2007 . CIDR report. http:\/\/www.cidr-report.org\/, Jan 2007."},{"key":"e_1_3_2_1_35_1","unstructured":"NetFlow v9 Export Format. http:\/\/www.cisco.com\/univercd\/cc\/td\/doc\/product\/software\/ios123\/123newft\/123_1\/nfv9expf.htm.  NetFlow v9 Export Format. http:\/\/www.cisco.com\/univercd\/cc\/td\/doc\/product\/software\/ios123\/123newft\/123_1\/nfv9expf.htm."},{"key":"e_1_3_2_1_36_1","unstructured":"University of Oregon Route Views project. http:\/\/www.routeviews.org\/.  University of Oregon Route Views project. http:\/\/www.routeviews.org\/."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.16"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028802"}],"event":{"name":"SIGCOMM07: ACM SIGCOMM 2007 Conference","location":"Kyoto Japan","acronym":"SIGCOMM07","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282380.1282392","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1282380.1282392","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:13:51Z","timestamp":1750245231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282380.1282392"}},"subtitle":["towards programmable network measurement"],"short-title":[],"issued":{"date-parts":[[2007,8,27]]},"references-count":38,"alternative-id":["10.1145\/1282380.1282392","10.1145\/1282380"],"URL":"https:\/\/doi.org\/10.1145\/1282380.1282392","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1282427.1282392","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,8,27]]},"assertion":[{"value":"2007-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}