{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:16Z","timestamp":1740099616534,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389901"},{"type":"electronic","value":"9783030389918"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38991-8_4","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T20:34:32Z","timestamp":1579638872000},"page":"48-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["HBL-Sketch: A New Three-Tier Sketch for Accurate Network Measurement"],"prefix":"10.1007","author":[{"given":"Keyan","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junxiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8770-3934","authenticated-orcid":false,"given":"Heng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqiu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"4_CR1","unstructured":"The caida anonymized internet traces. \nhttp:\/\/www.caida.org\/data\/overview.\/"},{"key":"4_CR2","unstructured":"Cisco netflow. \nhttp:\/\/www.cisco.com"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"AlGhadhban, A., Shihada, B.: Flight: a fast and lightweight elephant-flow detection mechanism. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 1537\u20131538. IEEE (2018)","DOI":"10.1109\/ICDCS.2018.00161"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Alipourfard, O., Moshref, M., Zhou, Y., Yang, T., Yu, M.: A comparison of performance and accuracy of measurement algorithms in software. In: Proceedings of the Symposium on SDN Research, p. 18. ACM (2018)","DOI":"10.1145\/3185467.3185475"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ben Basat, R., Einziger, G., Friedman, R., Luizelli, M.C., Waisbard, E.: Constant time updates in hierarchical heavy hitters. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 127\u2013140. ACM (2017)","DOI":"10.1145\/3098822.3098832"},{"issue":"7","key":"4_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Brauckhoff, D., Tellenbach, B., Wagner, A., May, M., Lakhina, A.: Impact of packet sampling on anomaly detection metrics. In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, pp. 159\u2013164. ACM (2006)","DOI":"10.1145\/1177080.1177101"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"issue":"1","key":"4_CR9","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(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek, M., Liu, S.H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45(3), 35\u201368 (2013)","journal-title":"ACM Comput. Surv."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/964725.633056","volume":"32","author":"C Estan","year":"2002","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting. ACM SIGCOMM Comput. Commun. Rev. 32, 323\u2013336 (2002)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR13","unstructured":"Gong, J., et al.: HeavyKeeper: an accurate algorithm for finding top-k elephant flows. In: 2018 USENIX Annual Technical Conference (USENIX ATC 2018), pp. 909\u2013921 (2018)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Q., et al.: SketchVisor: robust network measurement for software packet processing. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, pp. 113\u2013126. ACM (2017)","DOI":"10.1145\/3098822.3098831"},{"key":"4_CR15","unstructured":"Li, Y., Miao, R., Kim, C., Yu, M.: FlowRadar: a better NetFlow for data centers. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2016), pp. 311\u2013324 (2016)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Liu, Z., Manousis, A., Vorsanger, G., Sekar, V., Braverman, V.: One sketch to rule them all: rethinking network flow monitoring with univmon. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 101\u2013114. ACM (2016)","DOI":"10.1145\/2934872.2934906"},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"e1987","DOI":"10.1002\/nem.1987","volume":"27","author":"Z Liu","year":"2017","unstructured":"Liu, Z., Gao, D., Liu, Y., Zhang, H., Foh, C.H.: An adaptive approach for elephant flow detection with the rapidly changing traffic in data center network. Int. J. Network Manage. 27(6), e1987 (2017)","journal-title":"Int. J. Network Manage."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Mai, J., Chuah, C.N., Sridharan, A., Ye, T., Zang, H.: Is sampled data sufficient for anomaly detection? In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, pp. 165\u2013176. ACM (2006)","DOI":"10.1145\/1177080.1177102"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Poupart, P., et al.: Online flow size prediction for improved network routing. In: 2016 IEEE 24th International Conference on Network Protocols (ICNP), pp. 1\u20136. IEEE (2016)","DOI":"10.1109\/ICNP.2016.7785324"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Przybylski, S., Horowitz, M., Hennessy, J.: Characteristics of performance-optimal multi-level cache hierarchies. In: The 16th Annual International Symposium on Computer Architecture, pp. 114\u2013121. IEEE (1989)","DOI":"10.1145\/74926.74939"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Sivaraman, V., Narayana, S., Rottenstreich, O., Muthukrishnan, S., Rexford, J.: Heavy-hitter detection entirely in the data plane. In: Proceedings of the Symposium on SDN Research, pp. 164\u2013176. ACM (2017)","DOI":"10.1145\/3050220.3063772"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Wang, M., Li, B., Li, Z.: sFlow: towards resource-efficient and agile service federation in service overlay networks. In: Proceedings of the 24th International Conference on Distributed Computing Systems, pp. 628\u2013635. IEEE (2004)","DOI":"10.1109\/ICDCS.2004.1281630"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Wellem, T., Lai, Y.K., Chung, W.Y.: A software defined sketch system for traffic monitoring. In: Proceedings of the Eleventh ACM\/IEEE Symposium on Architectures for Networking and Communications Systems, pp. 197\u2013198. IEEE Computer Society (2015)","DOI":"10.1109\/ANCS.2015.7110138"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Wellem, T., Lai, Y.K., Huang, C.Y., Chung, W.Y.: A hardware-accelerated infrastructure for flexible sketch-based network traffic monitoring. In: 2016 IEEE 17th International Conference on High Performance Switching and Routing (HPSR), pp. 162\u2013167. IEEE (2016)","DOI":"10.1109\/HPSR.2016.7525661"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Elastic sketch: adaptive and fast network-wide measurements. In: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, pp. 561\u2013575. ACM (2018)","DOI":"10.1145\/3230543.3230544"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Sf-sketch: a fast, accurate, and memory efficient data structure to store frequencies of data items. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 103\u2013106. IEEE (2017)","DOI":"10.1109\/ICDE.2017.50"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Yang, T., et al.: Empowering sketches with machine learning for network measurements. In: Proceedings of the 2018 Workshop on Network Meets AI & ML, pp. 15\u201320. ACM (2018)","DOI":"10.1145\/3229543.3229545"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, A., Zhu, H., Liu, L., Zhu, C.: Identification of heavy hitters for network data streams with probabilistic sketch. In: 2018 IEEE 3rd International Conference on Cloud Computing and Big Data Analysis (ICCCBDA), pp. 451\u2013456. IEEE (2018)","DOI":"10.1109\/ICCCBDA.2018.8386558"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Jin, H., Liu, P., Zhang, H., Yang, T., Li, X.: Accurate per-flow measurement with bloom sketch. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 1\u20132. IEEE (2018)","DOI":"10.1109\/INFCOMW.2018.8406964"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Liu, P., Jin, H., Yang, T., Dang, S., Li, X.: One memory access sketch: a more accurate and faster sketch for per-flow measurement. In: GLOBECOM 2017\u20132017 IEEE Global Communications Conference, pp. 1\u20136. IEEE (2017)","DOI":"10.1109\/GLOCOM.2017.8254741"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38991-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T20:45:14Z","timestamp":1579639514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38991-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389901","9783030389918"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38991-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"251","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":"73","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":"29","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":"29% - 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":"2.4","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.8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}