{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T21:01:29Z","timestamp":1720472489741},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1016\/j.future.2019.07.031","type":"journal-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T11:22:30Z","timestamp":1563535350000},"page":"770-784","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["CMSS: Sketching based reliable tracking of large network flows"],"prefix":"10.1016","volume":"101","author":[{"given":"Massimo","family":"Cafaro","sequence":"first","affiliation":[]},{"given":"Italo","family":"Epicoco","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Pulimeno","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.future.2019.07.031_b1","series-title":"Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI\u201910","first-page":"19","article-title":"Hedera: Dynamic flow scheduling for data center networks","author":"Al-Fares","year":"2010"},{"issue":"4","key":"10.1016\/j.future.2019.07.031_b2","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/TNET.2005.852881","article-title":"Load balancing for parallel forwarding","volume":"13","author":"Shi","year":"2005","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.future.2019.07.031_b3","series-title":"Proceedings of the 2014 ACM Conference on SIGCOMM, SIGCOMM \u201914","first-page":"503","article-title":"CONGA: Distributed congestion-aware load balancing for datacenters","author":"Alizadeh","year":"2014"},{"key":"10.1016\/j.future.2019.07.031_b4","series-title":"Proceedings of the Seventh COnference on Emerging Networking EXperiments and Technologies, CoNEXT \u201911","first-page":"8:1","article-title":"Microte: Fine grained traffic engineering for data centers","author":"Benson","year":"2011"},{"key":"10.1016\/j.future.2019.07.031_b5","series-title":"Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM \u201909","first-page":"303","article-title":"Safe and effective fine-grained TCP retransmissions for datacenter communication","author":"Vasudevan","year":"2009"},{"issue":"2","key":"10.1016\/j.future.2019.07.031_b6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/TNET.2009.2025927","article-title":"Upgrading mice to elephants: Effects and end-point solutions","volume":"18","author":"Mondal","year":"2010","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"10.1016\/j.future.2019.07.031_b7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/90.851987","article-title":"Analysis of rerouting in circuit-switched networks","volume":"8","author":"Wong","year":"2000","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b8","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TNET.2017.2780852","article-title":"Fast rerouting against multi-link failures without topology constraint","volume":"26","author":"Yang","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"10.1016\/j.future.2019.07.031_b9","doi-asserted-by":"crossref","first-page":"2583","DOI":"10.1109\/TNET.2018.2871089","article-title":"Load-optimal local fast rerouting for dense networks","volume":"26","author":"Borokhovich","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.future.2019.07.031_b10","doi-asserted-by":"crossref","unstructured":"A. Kabbani, M. Alizadeh, M. Yasuda, R. Pan, B. Prabhakar, AF-QCN: Approximate fairness with quantized congestion notification for multi-tenanted data centers, in: 2010 18th IEEE Symposium on High Performance Interconnects, Aug 2010, pp. 58\u201365.","DOI":"10.1109\/HOTI.2010.26"},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b11","first-page":"18","article-title":"Anomaly-based network intrusion detection: Techniques, systems and challenges","volume":"28","author":"a\u00a0Teodoro","year":"2009","journal-title":"Comput. Secur."},{"issue":"3","key":"10.1016\/j.future.2019.07.031_b12","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/65.283931","article-title":"Network intrusion detection","volume":"8","author":"Mukherjee","year":"1994","journal-title":"IEEE Netw."},{"key":"10.1016\/j.future.2019.07.031_b13","series-title":"Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies, CoNEXT \u201913","first-page":"25","article-title":"An adaptive flow counting method for anomaly detection in SDN","author":"Zhang","year":"2013"},{"key":"10.1016\/j.future.2019.07.031_b14","doi-asserted-by":"crossref","unstructured":"G. Einziger, R. Friedman, TinyLFU: A highly efficient cache admission policy, in: 2014 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Feb 2014, pp. 146\u2013153.","DOI":"10.1109\/PDP.2014.34"},{"key":"10.1016\/j.future.2019.07.031_b15","series-title":"Proceedings of the 2007 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM \u201907","first-page":"109","article-title":"Accurate and efficient SLA compliance monitoring","author":"Sommers","year":"2007"},{"key":"10.1016\/j.future.2019.07.031_b16","series-title":"Proceedings of the ACM SIGCOMM 2011 Conference, SIGCOMM \u201911","first-page":"254","article-title":"Devoflow: Scaling flow management for high-performance networks","author":"Curtis","year":"2011"},{"key":"10.1016\/j.future.2019.07.031_b17","series-title":"Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM \u201904","first-page":"245","article-title":"Building a better netflow","author":"Estan","year":"2004"},{"key":"10.1016\/j.future.2019.07.031_b18","unstructured":"P. Phaal, M. Lavine, sFlow Version 5, July 2004. (Accessed 7 February 2019)."},{"key":"10.1016\/j.future.2019.07.031_b19","doi-asserted-by":"crossref","unstructured":"H. Xu, H. Huang, S. Chen, G. Zhao, Scalable software-defined networking through hybrid switching, in: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, May 2017, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2017.8057001"},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","article-title":"An improved data stream summary: the count-min sketch and its applications","volume":"55","author":"Cormode","year":"2005","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/j.future.2019.07.031_b21","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1145\/1166074.1166084","article-title":"An integrated efficient solution for computing frequent and top-k elements in data streams","volume":"31","author":"Metwally","year":"2006","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"10.1016\/j.future.2019.07.031_b22","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1109\/TNET.2018.2877700","article-title":"CountMax: A lightweight and cooperative sketch measurement for software-defined networks","volume":"26","author":"Yu","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"10.1016\/j.future.2019.07.031_b23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","article-title":"Finding repeated elements","volume":"2","author":"Misra","year":"1982","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.future.2019.07.031_b24","series-title":"Automated Reasoning: Essays in Honor of Woody Bledsoe, Automated Reasoning Series","first-page":"105","article-title":"MJRTY \u2013 A Fast majority vote algorithm","author":"Boyer","year":"1991"},{"key":"10.1016\/j.future.2019.07.031_b25","doi-asserted-by":"crossref","unstructured":"Erik\u00a0D. Demaine, Alejandro L\u00f3pez-Ortiz, J.\u00a0Ian Munro, Frequency estimation of internet packet streams with limited space, in: ESA, 2002, pp. 348\u2013360.","DOI":"10.1007\/3-540-45749-6_33"},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","article-title":"A simple algorithm for finding frequent elements in streams and bags","volume":"28","author":"Karp","year":"2003","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.future.2019.07.031_b27","doi-asserted-by":"crossref","unstructured":"Gurmeet\u00a0Singh Manku, Rajeev Motwani, Approximate frequency counts over data streams, in: VLDB, 2002, pp. 346\u2013357.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"10.1016\/j.future.2019.07.031_b28","series-title":"ICALP \u201902: Proceedings of the 29th International Colloquium on Automata, Languages and Programming","first-page":"693","article-title":"Finding frequent items in data streams","author":"Charikar","year":"2002"},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/1061318.1061325","article-title":"What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically","volume":"30","author":"Cormode","year":"2005","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/j.future.2019.07.031_b30","series-title":"Proc. of CIKM","first-page":"287","article-title":"Dynamically maintaining frequent items over a data stream","author":"Jin","year":"2003"},{"key":"10.1016\/j.future.2019.07.031_b31","series-title":"Proceedings of the 2016 ACM SIGCOMM Conference, SIGCOMM \u201916","first-page":"101","article-title":"One sketch to rule them all: Rethinking network flow monitoring with univmon","author":"Liu","year":"2016"},{"key":"10.1016\/j.future.2019.07.031_b32","series-title":"Proceedings of the Conference of the ACM Special Interest Group on Data Communication, SIGCOMM \u201917","first-page":"113","article-title":"Sketchvisor: Robust network measurement for software packet processing","author":"Huang","year":"2017"},{"issue":"24","key":"10.1016\/j.future.2019.07.031_b33","doi-asserted-by":"crossref","first-page":"4958","DOI":"10.1016\/j.ins.2010.08.024","article-title":"Finding top-k elements in data streams","volume":"180","author":"Homem","year":"2010","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.07.031_b34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2015.09.003","article-title":"A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution","volume":"329","author":"Cafaro","year":"2016","journal-title":"Inform. Sci."},{"issue":"15","key":"10.1016\/j.future.2019.07.031_b35","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1002\/cpe.1761","article-title":"Finding frequent items in parallel","volume":"23","author":"Cafaro","year":"2011","journal-title":"Concurr. Comput. Practice Exp."},{"key":"10.1016\/j.future.2019.07.031_b36","unstructured":"Massimo Cafaro, Marco Pulimeno, Merging frequent summaries, in: Proceedings of the 17th Italian Conference on Theoretical Computer Science (ICTCS 2016), Volume 1720, CEUR Proceedings, 2016, pp. 280\u2013285."},{"key":"10.1016\/j.future.2019.07.031_b37","series-title":"Instrumentation, Measurement, Computer, Communication and Control (IMCCC), Second International Conference on","first-page":"757","article-title":"Parallelizing the weighted lossy counting algorithm in high-speed network monitoring","author":"Zhang","year":"2012"},{"issue":"18","key":"10.1016\/j.future.2019.07.031_b38","doi-asserted-by":"crossref","first-page":"2856","DOI":"10.1002\/cpe.3182","article-title":"An efficient framework for parallel and continuous frequent item monitoring","volume":"26","author":"Zhang","year":"2014","journal-title":"Concurr. Comput.: Pract. Exper."},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b39","doi-asserted-by":"crossref","first-page":"217","DOI":"10.14778\/1687627.1687653","article-title":"Thread cooperation in multicore architectures for frequency counting over multiple data streams","volume":"2","author":"Das","year":"2009","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.future.2019.07.031_b40","series-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201912","first-page":"1451","article-title":"Efficient frequent item counting in multi-core hardware","author":"Roy","year":"2012"},{"key":"10.1016\/j.future.2019.07.031_b41","series-title":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201914","first-page":"236","article-title":"Parallel streaming frequency-based aggregates","author":"Tangwongsan","year":"2014"},{"key":"10.1016\/j.future.2019.07.031_b42","series-title":"Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201905","first-page":"611","article-title":"Fast and approximate stream mining of quantiles and frequencies using graphics processors","author":"Govindaraju","year":"2005"},{"key":"10.1016\/j.future.2019.07.031_b43","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.procs.2012.04.010","article-title":"Frequent items mining acceleration exploiting fast parallel sorting on the {GPU}","volume":"9","author":"Erra","year":"2012","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.future.2019.07.031_b44","doi-asserted-by":"crossref","unstructured":"M. Cafaro, I. Epicoco, G. Aloisio, M. Pulimeno, CUDA based parallel implementations of space-saving on a GPU, in: 2017 International Conference on High Performance Computing Simulation (HPCS), July 2017, pp. 707\u2013714.","DOI":"10.1109\/HPCS.2017.108"},{"issue":"7","key":"10.1016\/j.future.2019.07.031_b45","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4160","article-title":"Parallel space saving on multi- and many-core processors","volume":"30","author":"Cafaro","year":"2017","journal-title":"Concurr. Comput.: Pract. Exper."},{"key":"10.1016\/j.future.2019.07.031_b46","series-title":"Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201902","first-page":"635","article-title":"Maintaining stream statistics over sliding windows: (extended abstract)","author":"Datar","year":"2002"},{"issue":"2","key":"10.1016\/j.future.2019.07.031_b47","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1561\/0400000002","article-title":"Data streams: Algorithms and applications","volume":"1","author":"Muthukrishnan","year":"2005","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.future.2019.07.031_b48","doi-asserted-by":"crossref","unstructured":"G. Cormode, F. Korn, S. Tirthapura, Exponentially decayed aggregates on data streams, in: Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on, April 2008, pp. 1379\u20131381.","DOI":"10.1109\/ICDE.2008.4497562"},{"key":"10.1016\/j.future.2019.07.031_b49","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","article-title":"Mining frequent items in data stream using time fading model","volume":"257","author":"Chen","year":"2014","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/j.future.2019.07.031_b50","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1007\/s11280-017-0433-5","article-title":"Novel structures for counting frequent items in time decayed streams","volume":"20","author":"Wu","year":"2017","journal-title":"World Wide Web"},{"key":"10.1016\/j.future.2019.07.031_b51","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.ins.2016.07.077","article-title":"Mining frequent items in the time fading model","volume":"370\u2013371","author":"Cafaro","year":"2016","journal-title":"Inform. Sci."},{"key":"10.1016\/j.future.2019.07.031_b52","doi-asserted-by":"crossref","first-page":"24078","DOI":"10.1109\/ACCESS.2017.2757238","article-title":"On frequency estimation and detection of frequent items in time faded streams","volume":"5","author":"Cafaro","year":"2017","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2019.07.031_b53","doi-asserted-by":"crossref","unstructured":"G. Cormode, V. Shkapenyuk, D. Srivastava, Bojian Xu, Forward decay: A practical time decay model for streaming systems, in: Data Engineering, 2009. ICDE \u201909. IEEE 25th International Conference on, March 2009, pp. 138\u2013149.","DOI":"10.1109\/ICDE.2009.65"},{"key":"10.1016\/j.future.2019.07.031_b54","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.eswa.2017.11.021","article-title":"Parallel mining of time-faded heavy hitters","volume":"96","author":"Cafaro","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.future.2019.07.031_b55","series-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC \u201904","first-page":"206","article-title":"Efficient top-k query Calculation in distributed networks","author":"Cao","year":"2004"},{"key":"10.1016\/j.future.2019.07.031_b56","series-title":"Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS \u201906","first-page":"298","article-title":"Finding global icebergs over distributed data sets","author":"Zhao","year":"2006"},{"key":"10.1016\/j.future.2019.07.031_b57","series-title":"Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201906","first-page":"289","article-title":"Communication-efficient distributed monitoring of thresholded counts","author":"Keralapura","year":"2006"},{"key":"10.1016\/j.future.2019.07.031_b58","unstructured":"A. Manjhi, V. Shkapenyuk, K. Dhamdhere, C. Olston, Finding (recently) frequent items in distributed data streams, in: Data Engineering, 2005. ICDE 2005. Proceedings. 21st International Conference on, April 2005, pp. 767\u2013778."},{"key":"10.1016\/j.future.2019.07.031_b59","doi-asserted-by":"crossref","unstructured":"Shobha Venkataraman, Dawn Xiaodong\u00a0Song, Phillip B.\u00a0Gibbons, Avrim Blum, New streaming algorithms for fast detection of superspreaders, in: Proceedings of the Network and Distributed System Security Symposium, NDSS, 2005.","DOI":"10.21236\/ADA461026"},{"key":"10.1016\/j.future.2019.07.031_b60","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.comnet.2016.07.008","article-title":"An outlier mining-based malicious node detection model for hybrid P2P networks","volume":"108","author":"Meng","year":"2016","journal-title":"Comput. Netw."},{"key":"10.1016\/j.future.2019.07.031_b61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.future.2018.12.030","article-title":"Mining frequent items in unstructured P2P networks","volume":"95","author":"Cafaro","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"10.1016\/j.future.2019.07.031_b62","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/s10618-015-0438-6","article-title":"Identifying correlated heavy-hitters in a two-dimensional data stream","volume":"30","author":"Lahiri","year":"2016","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"10.1016\/j.future.2019.07.031_b63","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s10618-017-0526-x","article-title":"Fast and accurate mining of correlated heavy hitters","volume":"32","author":"Epicoco","year":"2018","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.future.2019.07.031_b64","doi-asserted-by":"crossref","unstructured":"M. Pulimeno, I. Epicoco, M. Cafaro, C. Melle, G. Aloisio, Parallel mining of correlated heavy hitters on distributed and shared-memory architectures, in: 2018 IEEE International Conference on Big Data (Big Data), Dec 2018, pp. 5111\u20135118.","DOI":"10.1109\/BigData.2018.8622201"},{"key":"10.1016\/j.future.2019.07.031_b65","series-title":"Computational Science and Its Applications \u2013 ICCSA 2018","first-page":"627","article-title":"Parallel mining of correlated heavy hitters","author":"Pulimeno","year":"2018"},{"issue":"10","key":"10.1016\/j.future.2019.07.031_b66","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1562764.1562789","article-title":"Finding the frequent items in streams of data","volume":"52","author":"Cormode","year":"2009","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/j.future.2019.07.031_b67","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","article-title":"Frequent items in streaming data: An experimental evaluation of the state-of-the-art","volume":"68","author":"Manerikar","year":"2009","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.future.2019.07.031_b68","unstructured":"The CAIDA UCSD anonymized internet traces - New York 2018-03-15. 2018. http:\/\/www.caida.org\/data\/passive\/passive_dataset.xml. (Accessed 7 February 2019)."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X1930490X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X1930490X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T10:57:03Z","timestamp":1574161023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X1930490X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":68,"alternative-id":["S0167739X1930490X"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2019.07.031","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"CMSS: Sketching based reliable tracking of large network flows","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2019.07.031","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
