{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:08Z","timestamp":1743044048077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030004330"},{"type":"electronic","value":"9783030004347"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00434-7_5","type":"book-chapter","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T17:35:51Z","timestamp":1535736951000},"page":"89-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CLEF: Limiting the Damage Caused by Large Flows in the Internet Core"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5100-1519","authenticated-orcid":false,"given":"Hao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9592-6911","authenticated-orcid":false,"given":"Hsu-Chun","family":"Hsiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5699-9237","authenticated-orcid":false,"given":"Daniele E.","family":"Asoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9557-1700","authenticated-orcid":false,"given":"Simon","family":"Scherrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5280-5412","authenticated-orcid":false,"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7829-3929","authenticated-orcid":false,"given":"Yih-Chun","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Andersen, D.G., Balakrishnan, H., Feamster, N., Koponen, T., Moon, D., Shenker, S.: Accountable internet protocol (AIP). In: Proceedings of ACM SIGCOMM (2008). https:\/\/doi.org\/10.1145\/1402958.1402997","DOI":"10.1145\/1402958.1402997"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-38082-2_2","volume-title":"The Future Internet: Future Internet Assembly 2013: Validated Results and New Horizons","author":"T Anderson","year":"2013","unstructured":"Anderson, T., et al.: The NEBULA future internet architecture. In: Galis, A., Gavras, A. (eds.) FIA 2013. LNCS, vol. 7858, pp. 16\u201326. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38082-2_2"},{"key":"5_CR3","unstructured":"Antonakakis, M., et al.: Understanding the Mirai botnet. In: USENIX Security Symposium (2017)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Basescu, C., et al.: SIBRA: scalable internet bandwidth reservation architecture. In: Proceedings of Network and Distributed System Security Symposium (NDSS), February 2016","DOI":"10.14722\/ndss.2016.23132"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Braden, R., Clark, D., Shenker, S.: Integrated services in the internet architecture: an overview. RFC 1633 (Informational), June 1994. http:\/\/www.ietf.org\/rfc\/rfc1633.txt","DOI":"10.17487\/rfc1633"},{"key":"5_CR6","unstructured":"CAIDA: CAIDA Anonymized Internet Traces 2016 (2016). https:\/\/data.caida.org\/datasets\/passive-2016\/"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/TNET.2016.2621159","volume":"25","author":"M Chen","year":"2017","unstructured":"Chen, M., Chen, S., Cai, Z.: Counter tree: a scalable counter architecture for per-flow traffic measurement. IEEE\/ACM Trans. Netw. (TON) 25(2), 1249\u20131262 (2017)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Claise, B.: Cisco Systems NetFlow Services Export Version 9, RFC 3954 (Informational), October 2004. http:\/\/www.ietf.org\/rfc\/rfc3954.txt","DOI":"10.17487\/rfc3954"},{"issue":"1","key":"5_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). https:\/\/doi.org\/10.1016\/j.jalgor.2003.12.001","journal-title":"J. Algorithms"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms \u2014 ESA 2002","author":"ED Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348\u2013360. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_33"},{"key":"5_CR11","unstructured":"Estan, C.: Internet traffic measurement: what\u2019s going on in my network? Ph.D. thesis (2003)"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst. (TOCS) 21(3), 270\u2013313 (2003). http:\/\/dl.acm.org\/citation.cfm?id=859719","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"5_CR13","unstructured":"Fang, M., Shivakumar, N.: Computing iceberg queries efficiently. In: Proceedings of VLDB (1999). http:\/\/ilpubs.stanford.edu:8090\/423\/"},{"key":"5_CR14","unstructured":"Han, D., et al.: XIA: efficient support for evolvable internetworking. In: Proceedings of the 9th USENIX NSDI, San Jose, CA, April 2012"},{"key":"5_CR15","unstructured":"Intel: Intel Xeon Processor E7 v4 Family (2016). https:\/\/ark.intel.com\/products\/series\/93797\/Intel-Xeon-Processor-E7-v4-Family"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51\u201355 (2003). https:\/\/doi.org\/10.1145\/762471.762473","journal-title":"ACM Trans. Database Syst."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Kim, T.H.J., Basescu, C., Jia, L., Lee, S.B., Hu, Y.C., Perrig, A.: Lightweight source authentication and path validation. In: ACM SIGCOMM Computer Communication Review, vol. 44, pp. 271\u2013282. ACM (2014)","DOI":"10.1145\/2619239.2626323"},{"issue":"12","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1109\/JSAC.2006.884032","volume":"24","author":"A Kumar","year":"2006","unstructured":"Kumar, A., Xu, J., Wang, J.: Space-code bloom filter for efficient per-flow traffic measurement. IEEE J. Sel. Areas Commun. 24(12), 2327\u20132339 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Lee, S.B., Kang, M.S., Gligor, V.D.: CoDef: collaborative defense against large-scale link-flooding attacks. In: Proceedings of CoNext (2013)","DOI":"10.1145\/2535372.2535398"},{"key":"5_CR20","unstructured":"Li, A., Liu, X., Yang, X.: Bootstrapping accountability in the internet we have. In: Proceedings of USENIX\/ACM NSDI, March 2011"},{"key":"5_CR21","unstructured":"Liu, X., Li, A., Yang, X., Wetherall, D.: Passport: secure and adoptable source authentication. In: Proceedings of USENIX\/ACM NSDI (2008). http:\/\/www.usenix.org\/event\/nsdi08\/tech\/full_papers\/liu_xin\/liu_xin_html\/"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Liu, Z., Manousis, A., Vorsanger, G., Sekar, V., Braverman, V.: One sketch to rule them all: rethinking network flow monitoring with UnivMon. In: ACM SIGCOMM (2016). https:\/\/doi.org\/10.1145\/2934872.2934906","DOI":"10.1145\/2934872.2934906"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Liu, Z., Jin, H., Hu, Y.C., Bailey, M.: MiddlePolice: toward enforcing destination-defined policies in the middle of the internet. In: Proceedings of ACM CCS, October 2016","DOI":"10.1145\/2976749.2978306"},{"key":"5_CR24","unstructured":"Manku, G., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of VLDB (2002). http:\/\/dl.acm.org\/citation.cfm?id=1287400"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"A Metwally","year":"2004","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 398\u2013412. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30570-5_27"},{"issue":"2","key":"5_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program. 2(2), 143\u2013152 (1982)","journal-title":"Sci. Comput. Program."},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Naous, J., Walfish, M., Nicolosi, A., Mazi\u00e8res, D., Miller, M., Seehra, A.: Verifying and enforcing network paths with ICING. In: Proceedings of ACM CoNEXT (2011). https:\/\/doi.org\/10.1145\/2079296.2079326","DOI":"10.1145\/2079296.2079326"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44676-1_10","volume-title":"Algorithms \u2014 ESA 2001","author":"R Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121\u2013133. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_10"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Shenker, S., Partridge, C., Guerin, R.: Specification of guaranteed quality of service, RFC 2212 (Proposed Standard), September 1997. http:\/\/www.ietf.org\/rfc\/rfc2212.txt","DOI":"10.17487\/rfc2212"},{"key":"5_CR30","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"},{"issue":"4","key":"5_CR31","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2927964.2927977","volume":"43","author":"D Tong","year":"2016","unstructured":"Tong, D., Prasanna, V.: High throughput sketch based online heavy hitter detection on FPGA. ACM SIGARCH Comput. Arch. News 43(4), 70\u201375 (2016)","journal-title":"ACM SIGARCH Comput. Arch. News"},{"key":"5_CR32","first-page":"4","volume":"2","author":"WA Trybulec","year":"1990","unstructured":"Trybulec, W.A.: Pigeon hole principle. J. Formaliz. Math. 2, 4 (1990)","journal-title":"Pigeon hole principle. J. Formaliz. Math."},{"key":"5_CR33","unstructured":"Wu, H., Hsiao, H.C., Asoni, D.E., Scherrer, S., Perrig, A., Hu, Y.C.: CLEF: limiting the damage caused by large flows in the internet core. Technical report, arXiv:1807.05652 [cs.NI], arXiv (2018). https:\/\/arxiv.org\/abs\/1807.05652"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Wu, H., Hsiao, H.C., Hu, Y.C.: Efficient large flow detection over arbitrary windows: an algorithm exact outside an ambiguity region. In: Proceedings of the 2014 Conference on Internet Measurement Conference, pp. 209\u2013222. ACM (2014)","DOI":"10.1145\/2663716.2663724"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Xiao, Q., Chen, S., Chen, M., Ling, Y.: Hyper-compact virtual estimators for big network data based on register sharing. In: ACM SIGMETRICS Performance Evaluation Review, vol. 43, pp. 417\u2013428. ACM (2015)","DOI":"10.1145\/2745844.2745870"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, X., Hsiao, H.C., Hasker, G., Chan, H., Perrig, A., Andersen, D.G.: SCION: scalability, control, and isolation on next-generation networks. In: IEEE Symposium on Security and Privacy, pp. 212\u2013227 (2011)","DOI":"10.21236\/ADA579930"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00434-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T06:01:28Z","timestamp":1571810488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00434-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030004330","9783030004347"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00434-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"1 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cans2018.na.icar.cnr.it\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"79","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"33% - 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"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"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"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}