{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:23:40Z","timestamp":1760235820404,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2021,9,25]],"date-time":"2021-09-25T00:00:00Z","timestamp":1632528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007166","name":"Jiangsu Provincial Department of Education","doi-asserted-by":"publisher","award":["20KJB413002"],"award-info":[{"award-number":["20KJB413002"]}],"id":[{"id":"10.13039\/501100007166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Provincial Public Security Department","award":["2020KX007Z"],"award-info":[{"award-number":["2020KX007Z"]}]},{"name":"Jiangsu Police Institute high level talent introduction research start-up fund","award":["JSPIGKZ"],"award-info":[{"award-number":["JSPIGKZ"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Super points detection plays an important role in network research and application. With the increase of network scale, distributed super points detection has become a hot research topic. The key point of super points detection in a multi-node distributed environment is how to reduce communication overhead. Therefore, this paper proposes a three-stage communication algorithm to detect super points in a distributed environment, Rough Estimator based Asynchronous Distributed super points detection algorithm (READ). READ uses a lightweight estimator, the Rough Estimator (RE), which is fast in computation and takes less memory to generate candidate super points. Meanwhile, the famous Linear Estimator (LE) is applied to accurately estimate the cardinality of each candidate super point, so as to detect the super point correctly. In READ, each node scans IP address pairs asynchronously. When reaching the time window boundary, READ starts three-stage communication to detect the super point. This paper proves that the accuracy of READ in a distributed environment is no less than that in the single-node environment. Four groups of 10 Gb\/s and 40 Gb\/s real-world high-speed network traffic are used to test READ. The experimental results show that READ not only has high accuracy in a distributed environment, but also has less than 5% of communication burden compared with existing algorithms.<\/jats:p>","DOI":"10.3390\/a14100277","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T01:59:47Z","timestamp":1632707987000},"page":"277","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rough Estimator Based Asynchronous Distributed Super Points Detection on High Speed Network Edge"],"prefix":"10.3390","volume":"14","author":[{"given":"Jie","family":"Xu","sequence":"first","affiliation":[{"name":"Jiangsu Police Institute, Nanjing 210031, China"}]},{"given":"Wei","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing 211102, China"}]}],"member":"1968","published-online":{"date-parts":[[2021,9,25]]},"reference":[{"key":"ref_1","unstructured":"China Internet Network Information Center (CNNIC) (2019). China Internet Network Development Statistic Report, China Internet Network Information Center (CNNIC). [43th ed.]."},{"key":"ref_2","unstructured":"Ai-Ping, Z. (2015). Research on the Key Issues of Traffic Measurement in High-Speed Networks. [Ph.D. Thesis, Southeast University]."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kucera, J., Kekely, L., Piecek, A., and Korenek, J. (2018, January 7\u201310). General IDS Acceleration for High-Speed Networks. Proceedings of the 2018 IEEE 36th International Conference on Computer Design (ICCD), Orlando, FL, USA.","DOI":"10.1109\/ICCD.2018.00062"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Venkataraman, S., Song, D., Gibbons, P.B., and Blum, A. (2005, January 24\u201327). New Streaming Algorithms for Fast Detection of Superspreaders. Proceedings of the Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA.","DOI":"10.21236\/ADA461026"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.jnca.2012.05.003","article-title":"A survey of intrusion detection techniques in Cloud","volume":"36","author":"Modi","year":"2013","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kamiyama, N., Mori, T., and Kawahara, R. (2007, January 6\u201312). Simple and Adaptive Identification of Superspreaders by Flow Sampling. Proceedings of the IEEE INFOCOM 2007\u201426th IEEE International Conference on Computer Communications, Anchorage, AK, USA.","DOI":"10.1109\/INFCOM.2007.305"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1109\/TIFS.2011.2123094","article-title":"A Data Streaming Method for Monitoring Host Connection Degrees of High-Speed Links","volume":"6","author":"Wang","year":"2011","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TIFS.2015.2503269","article-title":"Detection of Superpoints Using a Vector Bloom Filter","volume":"11","author":"Liu","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1109\/TNET.2010.2080285","article-title":"Fit a Compact Spread Estimator in Small High-speed Memory","volume":"19","author":"Yoon","year":"2011","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_10","unstructured":"Vaidya, J., and Li, J. (2018). Most Memory Efficient Distributed Super Points Detection on Core Networks. Algorithms and Architectures for Parallel Processing, Springer International Publishing."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.future.2018.09.042","article-title":"An adaptive and configurable protection framework against android privilege escalation threats","volume":"92","author":"Xu","year":"2019","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1016\/j.comcom.2013.05.006","article-title":"Line speed accurate superspreader identification using dynamic error compensation","volume":"36","author":"Cheng","year":"2013","journal-title":"Comput. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.neucom.2015.05.089","article-title":"A class-oriented feature selection approach for multi-class imbalanced network traffic datasets based on local and global metrics fusion","volume":"168","author":"Liu","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1109\/TNET.2013.2288352","article-title":"Towards More Efficient Cardinality Estimation for Large-Scale RFID Systems","volume":"22","author":"Zheng","year":"2014","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1109\/TMC.2012.19","article-title":"Contention-Based Estimation of Neighbor Cardinality","volume":"12","author":"Adam","year":"2013","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Li, B., He, Y., and Liu, W. (2015, January 1\u20134). Towards Constant-Time Cardinality Estimation for Large-Scale RFID Systems. Proceedings of the 2015 44th International Conference on Parallel Processing, Beijing, China.","DOI":"10.1109\/ICPP.2015.90"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Flajolet, P., and Martin, G.N. (1983, January 7\u20139). Probabilistic counting. Proceedings of the 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), Tucson, AZ, USA.","DOI":"10.1109\/SFCS.1983.46"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, E., Gandouet, O., and Meunier, F. (2007, January 17\u201322). HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm. Proceedings of the Analysis of Algorithms 2007 (AofA07), Juan les Pins, France.","DOI":"10.46298\/dmtcs.3545"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/78922.78925","article-title":"A Linear-time Probabilistic Counting Algorithm for Database Applications","volume":"15","author":"Whang","year":"1990","journal-title":"ACM Trans. Database Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Xu, J., Ding, W., Gong, J., Hu, X., and Liu, J. (2017, January 12\u201315). High Speed Network Super Points Detection Based on Sliding Time Window by GPU. Proceedings of the 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA\/IUCC), Guangzhou, China.","DOI":"10.1109\/ISPA\/IUCC.2017.00092"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Xu, J., Ding, W., Gong, J., Hu, X., and Sun, S. (2018, January 28\u201330). SRLA: A Real Time Sliding Time Window Super Point Cardinality Estimation Algorithm for High Speed Network Based on GPU. Proceedings of the 2018 IEEE 20th International Conference on High Performance Computing and Communications, IEEE 16th International Conference on Smart City, IEEE 4th International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), Exeter, UK.","DOI":"10.1109\/HPCC\/SmartCity\/DSS.2018.00156"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"43414","DOI":"10.1109\/ACCESS.2019.2908226","article-title":"A Super Point Detection Algorithm Under Sliding Time Windows Based on Rough and Linear Estimators","volume":"7","author":"Xu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1109\/TIFS.2017.2663333","article-title":"(Un)wisdom of Crowds: Accurately Spotting Malicious IP Clusters Using Not-So-Accurate IP Blacklists","volume":"12","author":"Coskun","year":"2017","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TNSM.2012.031512.110165","article-title":"An OSPF-Integrated Routing Strategy for QoS-Aware Energy Saving in IP Backbone Networks","volume":"9","author":"Cianfrani","year":"2012","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.sigpro.2015.05.017","article-title":"A new robust Chinese remainder theorem with improved performance in frequency estimation from undersampled waveforms","volume":"117","author":"Xiao","year":"2015","journal-title":"Signal Process."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.ipl.2010.07.024","article-title":"A new analysis of the false positive rate of a Bloom filter","volume":"110","author":"Christensen","year":"2010","journal-title":"Inf. Process. Lett."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.comcom.2019.02.005","article-title":"VATE: A trade-off between memory and preserving time for high accurate cardinality estimation under sliding time window","volume":"138","author":"Xu","year":"2019","journal-title":"Comput. Commun."},{"key":"ref_28","unstructured":"CAIDA (2021, September 24). The CAIDA Anonymized Internet Traces. Available online: http:\/\/www.caida.org\/data\/passive."},{"key":"ref_29","unstructured":"IPtas (2021, September 24). Network Technology Key Labratory of Jiangsu Province, IP Trace And Service. Available online: http:\/\/iptas.edu.cn\/src\/system.php."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/10\/277\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:04:55Z","timestamp":1760166295000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/10\/277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,25]]},"references-count":29,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2021,10]]}},"alternative-id":["a14100277"],"URL":"https:\/\/doi.org\/10.3390\/a14100277","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,9,25]]}}}