{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:09:31Z","timestamp":1752282571035,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T00:00:00Z","timestamp":1534118400000},"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":[[2018,8,13]]},"DOI":"10.1145\/3225058.3225078","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Cache Assisted Randomized Sharing Counters in Network Measurement"],"prefix":"10.1145","author":[{"given":"Qian","family":"Liu","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}]},{"given":"Haipeng","family":"Dai","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}]},{"given":"Alex X.","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA"}]},{"given":"Qi","family":"Li","sequence":"additional","affiliation":[{"name":"Air Force Engineering University, Xian, Shanxi, CHINA"}]},{"given":"Xiaoyu","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}]},{"given":"Jiaqi","family":"Zheng","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China"}]}],"member":"320","published-online":{"date-parts":[[2018,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"R. Basat G. Einziger R. Friedman and Y. Kassner. 2017. Optimal elephant flow detection. arXiv preprint arXiv:1701.04021 (2017).  R. Basat G. Einziger R. Friedman and Y. Kassner. 2017. Optimal elephant flow detection. arXiv preprint arXiv:1701.04021 (2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2621159"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"S. Chen M. Chen and Q. Xiao. 2017. Per-Flow Size Measurement. In Traffic Measurement for Big Network Data. Springer 11--45.  S. Chen M. Chen and Q. Xiao. 2017. Per-Flow Size Measurement. In Traffic Measurement for Big Network Data. Springer 11--45.","DOI":"10.1007\/978-3-319-47340-6_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"H. Dai M. Li and A. Liu. 2018. Finding Persistent Items in Distributed Datasets. In IEEE INFOCOM.  H. Dai M. Li and A. Liu. 2018. Finding Persistent Items in Distributed Datasets. In IEEE INFOCOM.","DOI":"10.1109\/INFOCOM.2018.8486425"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025112"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"E. Demaine A. L\u00f3pez-Ortiz and J. Munro. 2002. Frequency estimation of internet packet streams with limited space. Algorithms¡aESA (2002) 11--20.   E. Demaine A. L\u00f3pez-Ortiz and J. Munro. 2002. Frequency estimation of internet packet streams with limited space. Algorithms¡aESA (2002) 11--20.","DOI":"10.1007\/3-540-45749-6_33"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.852874"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"G. Einziger B. Fellman and Y. Kassner. 2015. Independent counter estimation buckets. In IEEE INFOCOM. 2560--2568.  G. Einziger B. Fellman and Y. Kassner. 2015. Independent counter estimation buckets. In IEEE INFOCOM. 2560--2568.","DOI":"10.1109\/INFOCOM.2015.7218646"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"e_1_3_2_1_10_1","unstructured":"Mentor Graphics. 2017. Modelsim user manual. (2017). https:\/\/www.mentor.com\/products\/fv\/modelsim.html.  Mentor Graphics. 2017. Modelsim user manual. (2017). https:\/\/www.mentor.com\/products\/fv\/modelsim.html."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005707"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.57"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"C. Hu S. Wang J. Tian B. Liu Y. Cheng and Y. Chen. 2008. Accurate and efficient traffic monitoring using adaptive non-linear sampling method. In IEEE INFOCOM. 26--30.  C. Hu S. Wang J. Tian B. Liu Y. Cheng and Y. Chen. 2008. Accurate and efficient traffic monitoring using adaptive non-linear sampling method. In IEEE INFOCOM. 26--30.","DOI":"10.1109\/INFOCOM.2008.14"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2010.26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"N. Kamiyama and T. Mori. 2006. Simple and Accurate Identification of High-Rate Flows by Packet Sampling. In IEEE INFOCOM. 1--13.  N. Kamiyama and T. Mori. 2006. Simple and Accurate Identification of High-Rate Flows by Packet Sampling. In IEEE INFOCOM. 1--13.","DOI":"10.1109\/INFOCOM.2006.324"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_3_2_1_17_1","first-page":"1808","article-title":"Runs based traffic estimator (RATE): A simple, memory efficient scheme for per-flow rate estimation","volume":"3","author":"Kodialam M.","year":"2004","unstructured":"M. Kodialam , T. V. Lakshman , and S. Mohanty . 2004 . Runs based traffic estimator (RATE): A simple, memory efficient scheme for per-flow rate estimation . IEEE INFOCOM 3 (2004), 1808 -- 1818 . M. Kodialam, T. V. Lakshman, and S. Mohanty. 2004. Runs based traffic estimator (RATE): A simple, memory efficient scheme for per-flow rate estimation. IEEE INFOCOM 3 (2004), 1808--1818.","journal-title":"IEEE INFOCOM"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1012888.1005709"},{"key":"e_1_3_2_1_19_1","unstructured":"E. Lehmann and G. Casella. 2006. Theory of point estimation. Springer Science & Business Media.  E. Lehmann and G. Casella. 2006. Theory of point estimation. Springer Science & Business Media."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"T. Li S. Chen and Y. Ling. 2011. Fast and compact per-flow traffic measurement through randomized counter sharing. In IEEE INFOCOM. 1799--1807.  T. Li S. Chen and Y. Ling. 2011. Fast and compact per-flow traffic measurement through randomized counter sharing. In IEEE INFOCOM. 1799--1807.","DOI":"10.1109\/INFCOM.2011.5934979"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2192447"},{"volume-title":"Foundations of Probability Theory","author":"Li X.","key":"e_1_3_2_1_22_1","unstructured":"X. Li . 1996. Foundations of Probability Theory ( second edition). Higher Education Press . 214--249 pages. X. Li. 1996. Foundations of Probability Theory (second edition). Higher Education Press. 214--249 pages."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177099"},{"key":"e_1_3_2_1_24_1","volume-title":"Case: Cache-assisted stretchable estimator for high speed per-flow measurement","author":"Li Y.","year":"2016","unstructured":"Y. Li , H. Wu , T. Pan , H. Dai , J. Lu , and B. Liu . 2016 . Case: Cache-assisted stretchable estimator for high speed per-flow measurement . In IEEE INFOCOM. 1--9. Y. Li, H. Wu, T. Pan, H. Dai, J. Lu, and B. Liu. 2016. Case: Cache-assisted stretchable estimator for high speed per-flow measurement. In IEEE INFOCOM. 1--9."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Y. Lu A. Montanari and B. Prabhakar. 2008. Counter braids: Asymptotic optimality of the message passing decoding algorithm. In IEEE ALLERTON. 209--216.  Y. Lu A. Montanari and B. Prabhakar. 2008. Counter braids: Asymptotic optimality of the message passing decoding algorithm. In IEEE ALLERTON. 209--216.","DOI":"10.1109\/ALLERTON.2008.4797558"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384529.1375472"},{"key":"e_1_3_2_1_27_1","unstructured":"J. Myung and D. Navarro. 2004. Information matrix. John Wiley & Sons Ltd.  J. Myung and D. Navarro. 2004. Information matrix. John Wiley & Sons Ltd."},{"key":"e_1_3_2_1_28_1","unstructured":"Mehta N. 2011. Xilinx 7 Series FPGAs: User Guide Lite. (2011). http:\/\/www.eetimes.com\/document.asp?doc_id=1278724.html.  Mehta N. 2011. Xilinx 7 Series FPGAs: User Guide Lite. (2011). http:\/\/www.eetimes.com\/document.asp?doc_id=1278724.html."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.249"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"E. Tsidon I. Hanniel and I. Keslassy. 2012. Estimators also need shared values to grow together. In IEEE INFOCOM. 1889--1897.  E. Tsidon I. Hanniel and I. Keslassy. 2012. Estimators also need shared values to grow together. In IEEE INFOCOM. 1889--1897.","DOI":"10.1109\/INFCOM.2012.6195564"},{"key":"e_1_3_2_1_31_1","unstructured":"XILINX. 2017. 7 Series FPGAs Data Sheet: Overview. (2017). http:\/\/www.xilinx.com\/support\/documentation\/data_sheets\/ds180_7Series_Overview.pdf.  XILINX. 2017. 7 Series FPGAs Data Sheet: Overview. (2017). http:\/\/www.xilinx.com\/support\/documentation\/data_sheets\/ds180_7Series_Overview.pdf."},{"key":"e_1_3_2_1_32_1","volume-title":"Diamond Sketch: Accurate Per-flow Measurement for Real IP Streams","author":"Yang T.","year":"2018","unstructured":"T. Yang , S. Gao , Z. Sun , Y. Wang , Y. Shen , and X. Li . 2018 . Diamond Sketch: Accurate Per-flow Measurement for Real IP Streams . In IEEE INFOCOM (Poster) . T. Yang, S. Gao, Z. Sun, Y. Wang, Y. Shen, and X. Li. 2018. Diamond Sketch: Accurate Per-flow Measurement for Real IP Streams. In IEEE INFOCOM (Poster)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2730227"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"T. Yang L. Liu Y. Yan M. Shahzad Y. Shen X. Li B. Cui and G. Xie. 2017. SF-sketch: A Fast Accurate and Memory Efficient Data Structure to Store Frequencies of Data Items. In IEEE ICDE.  T. Yang L. Liu Y. Yan M. Shahzad Y. Shen X. Li B. Cui and G. Xie. 2017. SF-sketch: A Fast Accurate and Memory Efficient Data Structure to Store Frequencies of Data Items. In IEEE ICDE.","DOI":"10.1109\/ICDE.2017.50"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229545"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"T. Yang H. Zhang H. Wang M. Shahzad Q. Xin X. Liu and X. Li. 2018. FID-sketch: An Accurate Sketch to Store Frequencies in Data Streams. World Wide Web Journal (2018).  T. Yang H. Zhang H. Wang M. Shahzad Q. Xin X. Liu and X. Li. 2018. FID-sketch: An Accurate Sketch to Store Frequencies in Data Streams. World Wide Web Journal (2018).","DOI":"10.1007\/s11280-018-0546-5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137652"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633055"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Y. Zhou Y. Zhou M. Chen Q. Xiao and S. Chen. 2017. Highly compact virtual counters for per-flow traffic measurement through register sharing. In IEEE GLOBECOM. 1--6.  Y. Zhou Y. Zhou M. Chen Q. Xiao and S. Chen. 2017. Highly compact virtual counters for per-flow traffic measurement through register sharing. In IEEE GLOBECOM. 1--6.","DOI":"10.1109\/GLOCOM.2016.7841873"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Y. Zhou Y. Zhou S. Chen and Y. Zhang. 2017. Per-flow counting for big network data stream over sliding windows. In IEEE\/ACM IWQOS. 1--10.  Y. Zhou Y. Zhou S. Chen and Y. Zhang. 2017. Per-flow counting for big network data stream over sliding windows. In IEEE\/ACM IWQOS. 1--10.","DOI":"10.1109\/IWQoS.2017.7969118"}],"event":{"name":"ICPP 2018: 47th International Conference on Parallel Processing","sponsor":["University of Oregon University of Oregon"],"location":"Eugene OR USA","acronym":"ICPP 2018"},"container-title":["Proceedings of the 47th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225078","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3225058.3225078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:07Z","timestamp":1750210747000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3225058.3225078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,13]]},"references-count":42,"alternative-id":["10.1145\/3225058.3225078","10.1145\/3225058"],"URL":"https:\/\/doi.org\/10.1145\/3225058.3225078","relation":{},"subject":[],"published":{"date-parts":[[2018,8,13]]},"assertion":[{"value":"2018-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}