{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:06:41Z","timestamp":1743120401885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031251573"},{"type":"electronic","value":"9783031251580"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25158-0_2","type":"book-chapter","created":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T21:37:20Z","timestamp":1676324240000},"page":"20-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MCSketch: An Accurate Sketch for Heavy Flow Detection and Heavy Flow Frequency Estimation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6831-7413","authenticated-orcid":false,"given":"Jie","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"2_CR1","unstructured":"Goyal, A., Daume, H., Cormode, G., et al.: Sketch algorithms for estimating point queries in NLP. In: Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning, pp. 1093\u20131103 (2012)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/TDSC.2018.2822275","volume":"16","author":"J Wang","year":"2018","unstructured":"Wang, J., Wen, R., Li, J., et al.: Detecting and mitigating target link-flooding attacks using SDN. IEEE Trans Dependable Secur Comput 16, 944\u2013956 (2018). https:\/\/doi.org\/10.1109\/TDSC.2018.2822275","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/TIFS.2018.2805600","volume":"13","author":"J Zheng","year":"2018","unstructured":"Zheng, J., Li, Q., Gu, G., et al.: Realtime DDoS defense using COTS SDN switches via adaptive correlation analysis. IEEE Trans. Inf. Forensics Secur. 13, 1838\u20131853 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2805600","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Tang, L., Huang, Q., Lee, P.P.C.: MV-Sketch: a fast and compact invertible sketch for heavy flow detection in network data streams. In: Proceedings - IEEE INFOCOM 2019-April, pp. 2026\u20132034 (2019). https:\/\/doi.org\/10.1109\/INFOCOM.2019.8737499","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Gong, J., Yang, T., Zhang, H., et al.: HeavyKeeper: An accurate algorithm for finding top-k elephant flows. In: Proc 2018 USENIX Annual Tech Conference USENIX ATC 2018, pp. 909\u2013921 (2018). https:\/\/doi.org\/10.1109\/tnet.2019.2933868","DOI":"10.1109\/tnet.2019.2933868"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Li, J., Li, Z., Xu, Y., et al.: WavingSketch: An Unbiased and Generic Sketch for Finding Top-k Items in Data Streams. In: Proceedings ACM SIGKDD International Conference Knowledge Discovery Data Mining, pp. 1574\u20131584 (2020). https:\/\/doi.org\/10.1145\/3394486.3403208","DOI":"10.1145\/3394486.3403208"},{"key":"2_CR7","unstructured":"Source code related to MCSketch. https:\/\/github.com\/Paper-commits\/MCSketch"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55, 58\u201375 (2005). https:\/\/doi.org\/10.1016\/j.jalgor.2003.12.001","journal-title":"J. Algorithms"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/510726.510749","volume":"32","author":"C Estan","year":"2002","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. Comput. Commun. Rev. 32, 75 (2002). https:\/\/doi.org\/10.1145\/510726.510749","journal-title":"Comput. Commun. Rev."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. Proc. VLDB Endow. 1(2), 1530\u20131541 (2008). https:\/\/doi.org\/10.14778\/1454159.1454225","DOI":"10.14778\/1454159.1454225"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Yang, T., Huang, Q., Miao, R., et al.: Elastic sketch: adaptive and fast network-wide measurements. In: SIGCOMM 2018 - Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication. Association for Computing Machinery, Inc, pp. 561\u2013575 (2018)","DOI":"10.1145\/3230543.3230544"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Yang, T., Jiang, J., et al.: Cold filter: a meta-framework for faster and more accurate stream processing. In: Proceedings of the ACM SIGMOD Int. Conf. Manage. Data, pp 741\u2013756 (2018)","DOI":"10.1145\/3183713.3183726"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Ting, D.: Count-min: optimal estimation and tight error bounds using empirical error distributions. In: Proc ACM SIGKDD Int. Conf. Knowl. Discov. Data Min., pp. 2319\u20132328 (2018). https:\/\/doi.org\/10.1145\/3219819.3219975","DOI":"10.1145\/3219819.3219975"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Q., Lee, P.P.C., Bao, Y.: SketChlearn: Relieving user burdens in approximate measurement with automated statistical inference. In: SIGCOMM 2018 - Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication. Association for Computing Machinery, Inc, pp. 576\u2013590 (2018)","DOI":"10.1145\/3230543.3230559"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Jie, L., Hongchang, C., Penghao, S., et al.: OrderSketch: an unbiased and fast sketch for frequency estimation of data streams. Comput. Networks 201, 108563 (2021)","DOI":"10.1016\/j.comnet.2021.108563"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.comnet.2015.08.025","volume":"91","author":"Q Huang","year":"2015","unstructured":"Huang, Q., Lee, P.P.C.: A hybrid local and distributed sketching design for accurate and scalable heavy key detection in network data streams. Comput. Networks 91, 298\u2013315 (2015). https:\/\/doi.org\/10.1016\/j.comnet.2015.08.025","journal-title":"Comput. Networks"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/LCOMM.2021.3077902","volume":"7798","author":"M Wu","year":"2021","unstructured":"Wu, M., Huang, H., Sun, Y., et al.: ActiveKeeper\u202f: an accurate and efficient algorithm for finding top- k elephant flows. IEEE Commun. Lett. 7798, 1\u20135 (2021). https:\/\/doi.org\/10.1109\/LCOMM.2021.3077902","journal-title":"IEEE Commun. Lett."},{"key":"2_CR18","unstructured":"The caida anonymized internet traces 2016. http:\/\/www.caida.org\/data\/overview\/"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25158-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T19:03:15Z","timestamp":1689879795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25158-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031251573","9783031251580"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25158-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}