A streaming algorithm and hardware accelerator to estimate the empirical entropy of network flows

The empirical entropy is used in network traffic monitoring and classification to detect anomalous events and manage network resources. Computing the entropy of high-speed traffic in real time requires dedicated hardware, such as programmable switches and FPGA-based accelerators. While these devices...

Full description

Saved in:
Bibliographic Details
Published in:Computer networks (Amsterdam, Netherlands : 1999) Vol. 237; p. 110035
Main Authors: Fernández, Yaime, Soto, Javier E., Vera, Sofía, Prieto, Yasmany, Hernández, Cecilia, Figueroa, Miguel
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.2023
Subjects:
ISSN:1389-1286, 1872-7069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The empirical entropy is used in network traffic monitoring and classification to detect anomalous events and manage network resources. Computing the entropy of high-speed traffic in real time requires dedicated hardware, such as programmable switches and FPGA-based accelerators. While these devices can achieve high performance by exploiting the parallelism of the algorithm, they possess limited on-chip storage. Thus, designing algorithms that estimate the entropy of network traffic with low error and memory usage is challenging. In this paper, we present an entropy-estimation streaming algorithm that operates on large datasets with sublinear memory usage. We use sketches to estimate the frequency and cardinality of network flows during an observation interval. We only store the frequencies of the most frequent flows and use them to estimate the rest of the frequencies by assuming a power-law distribution. Our results show that, using real network traces with observation intervals of up to 50 million flows, we can estimate their empirical entropy with 0.69% mean relative error, using more than three orders of magnitude less memory than an exact entropy-computation method. We also present an FPGA-based hardware accelerator for the algorithm that can operate at a line rate of more than 200 Gbps and an estimation latency of 16μs. Using fixed-point arithmetic and function approximations in the accelerator increases the mean estimation error of our algorithm by only 0.07%. •An algorithm that measures and models traffic to estimate its empirical entropy.•Algorithm achieves 0.69% error on large traces using sketches and a power-law fit.•Accelerator architecture exploits parallelism and optimizes on-chip memory usage.•FPGA implementation operates at line rate of 200 Gbps with 16 us estimation latency.
AbstractList The empirical entropy is used in network traffic monitoring and classification to detect anomalous events and manage network resources. Computing the entropy of high-speed traffic in real time requires dedicated hardware, such as programmable switches and FPGA-based accelerators. While these devices can achieve high performance by exploiting the parallelism of the algorithm, they possess limited on-chip storage. Thus, designing algorithms that estimate the entropy of network traffic with low error and memory usage is challenging. In this paper, we present an entropy-estimation streaming algorithm that operates on large datasets with sublinear memory usage. We use sketches to estimate the frequency and cardinality of network flows during an observation interval. We only store the frequencies of the most frequent flows and use them to estimate the rest of the frequencies by assuming a power-law distribution. Our results show that, using real network traces with observation intervals of up to 50 million flows, we can estimate their empirical entropy with 0.69% mean relative error, using more than three orders of magnitude less memory than an exact entropy-computation method. We also present an FPGA-based hardware accelerator for the algorithm that can operate at a line rate of more than 200 Gbps and an estimation latency of 16μs. Using fixed-point arithmetic and function approximations in the accelerator increases the mean estimation error of our algorithm by only 0.07%. •An algorithm that measures and models traffic to estimate its empirical entropy.•Algorithm achieves 0.69% error on large traces using sketches and a power-law fit.•Accelerator architecture exploits parallelism and optimizes on-chip memory usage.•FPGA implementation operates at line rate of 200 Gbps with 16 us estimation latency.
ArticleNumber 110035
Author Vera, Sofía
Soto, Javier E.
Figueroa, Miguel
Fernández, Yaime
Prieto, Yasmany
Hernández, Cecilia
Author_xml – sequence: 1
  givenname: Yaime
  orcidid: 0000-0002-4013-0745
  surname: Fernández
  fullname: Fernández, Yaime
  email: yfernandezj@udec.cl
  organization: Electrical Engineering Department, Universidad de Concepción, Chile
– sequence: 2
  givenname: Javier E.
  orcidid: 0000-0002-6057-0094
  surname: Soto
  fullname: Soto, Javier E.
  email: javsoto@udec.cl
  organization: Electrical Engineering Department, Universidad de Concepción, Chile
– sequence: 3
  givenname: Sofía
  orcidid: 0009-0008-3830-7821
  surname: Vera
  fullname: Vera, Sofía
  email: svera2017@udec.cl
  organization: Electrical Engineering Department, Universidad de Concepción, Chile
– sequence: 4
  givenname: Yasmany
  orcidid: 0000-0002-6827-2657
  surname: Prieto
  fullname: Prieto, Yasmany
  email: yprieto@ucsc.cl
  organization: Computer Science Department, Universidad Católica de la Santísima Concepción, Chile
– sequence: 5
  givenname: Cecilia
  orcidid: 0000-0003-1301-6987
  surname: Hernández
  fullname: Hernández, Cecilia
  email: cecihernandez@udec.cl
  organization: Computer Science Department, Universidad de Concepción, Chile
– sequence: 6
  givenname: Miguel
  orcidid: 0000-0002-5033-432X
  surname: Figueroa
  fullname: Figueroa, Miguel
  email: mifiguer@udec.cl
  organization: Electrical Engineering Department, Universidad de Concepción, Chile
BookMark eNp9kMtqwzAUREVJoUnaP-hCP2BXki3L2hRC6AsC3bRroV5fJUptK0iiIX9fh3Td1cxmhsNZkNkYRiTknrOSM9487EsIw4i5FExUJeeMVfKKzHmrRKFYo2dTr1pdcNE2N2SR0p4xVteinRO7oilHtIMft9T22xB93g3Ujh3d2dgdbURqAbDHaHOINAeKKfvBZqR5hxSHg48ebE9xzDEcTjQ4OqEcQ_ymrg_HdEuune0T3v3lknw-P32sX4vN-8vberUpQEiZC3C6lsxBW0GtsGulcoI72YAG22CrLHRSfUlVaa0F1I5r1WkHwsnKKtWoaknqyy_EkFJEZw5x4ownw5k5azJ7c9FkzprMRdM0e7zMcGL78RhNAo8jYOcjQjZd8P8f_AI0_XaK
Cites_doi 10.1016/j.comnet.2023.109696
10.1145/3185467.3185476
10.1016/j.future.2022.08.005
10.1016/j.comnet.2022.109315
10.1109/TPDS.2017.2766633
10.1109/ACCESS.2019.2927863
10.1109/ACCESS.2022.3210336
10.1016/0167-6423(82)90012-0
10.1145/3230543.3230544
10.1145/1921168.1921179
10.3390/su13031522
10.1016/j.cose.2017.07.004
10.1007/s11235-018-0475-8
10.1109/MNET.021.2000318
10.4218/etrij.2019-0190
10.1016/j.comnet.2021.108563
10.1016/S0304-3975(03)00400-6
10.1145/1644893.1644897
10.1006/jcss.1997.1545
10.3390/e23111465
10.1016/j.sysarc.2022.102561
10.1145/1352664.1352675
10.1145/1140103.1140295
10.1016/j.comnet.2017.02.015
10.1109/TNET.2018.2877700
10.1109/TNSM.2020.3048265
10.1016/j.inffus.2021.12.007
10.1016/j.future.2019.07.031
10.1109/ACCESS.2021.3088500
10.1109/MS.2011.127
10.3390/e22020186
10.1109/TDSC.2021.3072295
10.1002/j.1538-7305.1948.tb01338.x
10.1140/epjb/e2004-00316-5
10.1109/ACCESS.2020.3003918
10.1109/TNET.2021.3078725
10.1109/TDSC.2021.3116345
10.1109/ACCESS.2020.2979060
10.1016/j.compbiomed.2021.104250
10.1098/rsta.2012.0375
10.1145/1166074.1166084
10.1016/j.sysarc.2022.102621
10.1145/1147954.1147955
10.3390/electronics9060923
10.1145/2034594.2034598
10.1145/2934872.2934906
10.1145/1254882.1254895
10.3390/fi12090158
10.1145/2452376.2452456
10.1137/070710111
10.1109/COMST.2022.3213237
10.1016/j.inffus.2022.12.009
ContentType Journal Article
Copyright 2023 Elsevier B.V.
Copyright_xml – notice: 2023 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.comnet.2023.110035
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1872-7069
ExternalDocumentID 10_1016_j_comnet_2023_110035
S1389128623004802
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6OB
7-5
71M
77K
8P~
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABBOA
ABFNM
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
AXJTR
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F0J
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TAE
TN5
XFK
ZMT
ZY4
~G-
77I
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABJNI
ACLOT
ACVFH
ADCNI
AEIPS
AEUPX
AFJKZ
AFPUW
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c255t-cf9450fc83c47ed857f21f56c9ca6e87acd57b5739992c4f197d9fc2f53a77673
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001089108200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1389-1286
IngestDate Sat Nov 29 07:05:23 EST 2025
Fri Feb 23 02:35:24 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Shannon empirical entropy
Hardware acceleration
Sketch-based streaming algorithms
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c255t-cf9450fc83c47ed857f21f56c9ca6e87acd57b5739992c4f197d9fc2f53a77673
ORCID 0000-0002-4013-0745
0009-0008-3830-7821
0000-0002-5033-432X
0000-0002-6057-0094
0000-0002-6827-2657
0000-0003-1301-6987
ParticipantIDs crossref_primary_10_1016_j_comnet_2023_110035
elsevier_sciencedirect_doi_10_1016_j_comnet_2023_110035
PublicationCentury 2000
PublicationDate December 2023
2023-12-00
PublicationDateYYYYMMDD 2023-12-01
PublicationDate_xml – month: 12
  year: 2023
  text: December 2023
PublicationDecade 2020
PublicationTitle Computer networks (Amsterdam, Netherlands : 1999)
PublicationYear 2023
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Kulkarni, Chiosa, Preuß er, Kara, Sidler, Alonso (b50) 2020
T. Yang, J. Jiang, P. Liu, Q. Huang, J. Gong, Y. Zhou, R. Miao, X. Li, S. Uhlig, Elastic sketch: Adaptive and fast network-wide measurements, in: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018, pp. 561–575.
Cormode, Muthukrishnan (b45) 2011; 29
Zarei, Asl (b4) 2021; 131
Jie, Hongchang, Penghao, Tao, Zhen (b75) 2021; 201
Metwally, Agrawal, Abbadi (b57) 2006; 31
Fontugne, Fukuda (b71) 2011; 11
Clifford, Cosma (b12) 2013
Tong, Prasanna (b16) 2017; 29
Han, Jing, Yan, Pedrycz (b22) 2023; 92
Lapolli, Marques, Gaspary (b35) 2019
da Silveira Ilha, Lapolli, Marques, Gaspary (b39) 2020; 18
R. Fontugne, P. Borgnat, P. Abry, K. Fukuda, Mawilab: Combining diverse anomaly detectors for automated anomaly labeling and performance benchmarking, in: Proceedings of the 6th International Conference, 2010, pp. 1–12.
Jing, Han, Yan, Pedrycz (b28) 2021; 19
Ujjan, Pervez, Dahal, Khan, Khattak, Hayat (b8) 2021; 13
Harper (b64) 1974; 42
Lawrence, Ezeobi, Tauil, Nosal, Redwood, Zhuang, Bloom (b74) 2022; 129
Flajolet, Fusy, Gandouet, Meunier (b27) 2007
Ding, Savi, Siracusa (b15) 2020
Peccerillo, Mannino, Mondelli, Bartolini (b20) 2022; 129
S. Heule, M. Nunkesser, A. Hall, Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm, in: Proceedings of the 16th International Conference on Extending Database Technology, 2013, pp. 683–692.
CAIDA (b31) 2008
Jayadev, David (b56) 1982; 2
Y. Zhao, K. Yang, Z. Liu, T. Yang, L. Chen, S. Liu, N. Zheng, R. Wang, H. Wu, Y. Wang, et al., {LightGuardian}: A {full-visibility}, lightweight, in-band telemetry system using sketchlets, in: 18th USENIX Symposium on Networked Systems Design and Implementation, NSDI 21, 2021, pp. 991–1010.
Barabási (b33) 2013; 371
Clauset, Shalizi, Newman (b66) 2009; 51
R. Harrison, Q. Cai, A. Gupta, J. Rexford, Network-wide heavy hitter detection with commodity switches, in: Proceedings of the Symposium on SDN Research, 2018, pp. 1–7.
Callegari, Giordano, Pagano (b58) 2017; 70
D. Brauckhoff, X. Dimitropoulos, A. Wagner, K. Salamatian, Anomaly extraction in backbone networks using association rules, in: Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement, 2009, pp. 28–34.
Zhou, Wang, Wu, Hu (b9) 2020; 42
Fernandes, Rodrigues, Carvalho, Al-Muhtadi, Proença (b2) 2019; 70
Goldstein, Morris, Yen (b65) 2004; 41
Lai, Huang, Lee, Tsai, Chang, Nguyen, Lin, Liu, Chen (b42) 2020
Ventruto, Pulimeno, Cafaro, Epicoco (b26) 2020; 12
Bundala, Závodnỳ (b68) 2014
Lai, Tsai, Chuang, Ku, Chen (b36) 2022; 10
Indyk (b41) 2006; 53
Saeed, Alyafeai, Mahmoud (b10) 2022
Behal, Kumar (b6) 2017; 116
Zeng, Cui, Qian, Zhang, Wei (b29) 2023; 226
A. Goyal, H. Daumé III, G. Cormode, 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, 2012, pp. 1093–1103.
Xiao, Tang, Chen (b52) 2020
Appleby (b67) 2012
Yildiz, Aydin, Yilmaz (b69) 2013
Kianpisheh, Taleb (b13) 2023; 25
Yu, Xu, Yao, Wang, Huang (b24) 2018; 26
Lall, Sekar, Ogihara, Xu, Zhang (b11) 2006; 34
G. Dewaele, K. Fukuda, P. Borgnat, P. Abry, K. Cho, Extracting hidden anomalies using sketch and non gaussian multiresolution statistical detection procedures, in: Proceedings of the 2007 Workshop on Large Scale Attack Defense, 2007, pp. 145–152.
Soto, Ubisse, Fernández, Hernández, Figueroa (b19) 2021; 9
Tang, Huang, Lee (b21) 2019
González, Castanheira, Marques, Schaeffer-Filho, Gaspary (b40) 2021
H. Ringberg, A. Soule, J. Rexford, C. Diot, Sensitivity of PCA for traffic anomaly detection, in: Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007, pp. 109–120.
Saavedra, Lehnert, Hernández, Carvajal, Figueroa (b76) 2020; 8
Zhu, Chen, Kang (b63) 2020; 8
Huang, Sun, Ma, Chen, Du, Wang, Xiao (b18) 2021; 29
Soto, Ubisse, Hernández, Figueroa (b30) 2020
Charikar, Chen, Farach-Colton (b38) 2004; 312
Li, Zhang (b44) 2011
Alon, Matias, Szegedy (b37) 1999; 58
Basat, Einziger, Mitzenmacher, Vargaftik (b54) 2020
Shannon (b1) 1948; 27
Yu, Kim, Lim, Kim (b3) 2020; 22
Chabchoub, Chiky, Dogan (b48) 2014; 2014
Z. Liu, A. Manousis, G. Vorsanger, V. Sekar, V. Braverman, One sketch to rule them all: Rethinking network flow monitoring with univmon, in: Proceedings of the 2016 ACM SIGCOMM Conference, 2016, pp. 101–114.
Minton, Price (b53) 2014
Garcia, Parmisano, Erquiaga (b62) 2020
Ding, Savi, Siracusa (b34) 2021; 19
Caraiani, Lazarec (b5) 2021; 23
Wellem, Lai, Huang, Chung (b17) 2019; 7
Mazziane, Alouf, Neglia (b55) 2022; 217
Patel, Srinivasan, Chang, Gupta, Kataria (b7) 2020; 9
Han, Yan, Jing, Pedrycz (b23) 2022; 82
Soto, Hernández, Figueroa (b51) 2023; 138
Lai, Shih, Huang, Lee, Lin, Liu, Chen (b43) 2019
Cafaro, Epicoco, Pulimeno (b25) 2019; 101
Mai, Yao, Guo, Liu (b14) 2020; 35
Appleby (10.1016/j.comnet.2023.110035_b67) 2012
Alon (10.1016/j.comnet.2023.110035_b37) 1999; 58
Chabchoub (10.1016/j.comnet.2023.110035_b48) 2014; 2014
Yildiz (10.1016/j.comnet.2023.110035_b69) 2013
Xiao (10.1016/j.comnet.2023.110035_b52) 2020
Saavedra (10.1016/j.comnet.2023.110035_b76) 2020; 8
Basat (10.1016/j.comnet.2023.110035_b54) 2020
Peccerillo (10.1016/j.comnet.2023.110035_b20) 2022; 129
Lawrence (10.1016/j.comnet.2023.110035_b74) 2022; 129
Flajolet (10.1016/j.comnet.2023.110035_b27) 2007
Ding (10.1016/j.comnet.2023.110035_b15) 2020
10.1016/j.comnet.2023.110035_b49
10.1016/j.comnet.2023.110035_b47
Garcia (10.1016/j.comnet.2023.110035_b62) 2020
10.1016/j.comnet.2023.110035_b46
Indyk (10.1016/j.comnet.2023.110035_b41) 2006; 53
Harper (10.1016/j.comnet.2023.110035_b64) 1974; 42
CAIDA (10.1016/j.comnet.2023.110035_b31) 2008
Lapolli (10.1016/j.comnet.2023.110035_b35) 2019
Kianpisheh (10.1016/j.comnet.2023.110035_b13) 2023; 25
Soto (10.1016/j.comnet.2023.110035_b30) 2020
Yu (10.1016/j.comnet.2023.110035_b3) 2020; 22
Clifford (10.1016/j.comnet.2023.110035_b12) 2013
Cafaro (10.1016/j.comnet.2023.110035_b25) 2019; 101
Soto (10.1016/j.comnet.2023.110035_b19) 2021; 9
Jie (10.1016/j.comnet.2023.110035_b75) 2021; 201
Lall (10.1016/j.comnet.2023.110035_b11) 2006; 34
Mazziane (10.1016/j.comnet.2023.110035_b55) 2022; 217
Charikar (10.1016/j.comnet.2023.110035_b38) 2004; 312
Han (10.1016/j.comnet.2023.110035_b23) 2022; 82
Han (10.1016/j.comnet.2023.110035_b22) 2023; 92
Yu (10.1016/j.comnet.2023.110035_b24) 2018; 26
Shannon (10.1016/j.comnet.2023.110035_b1) 1948; 27
Behal (10.1016/j.comnet.2023.110035_b6) 2017; 116
Jayadev (10.1016/j.comnet.2023.110035_b56) 1982; 2
10.1016/j.comnet.2023.110035_b32
Tong (10.1016/j.comnet.2023.110035_b16) 2017; 29
Zeng (10.1016/j.comnet.2023.110035_b29) 2023; 226
Tang (10.1016/j.comnet.2023.110035_b21) 2019
10.1016/j.comnet.2023.110035_b73
Callegari (10.1016/j.comnet.2023.110035_b58) 2017; 70
10.1016/j.comnet.2023.110035_b72
Fernandes (10.1016/j.comnet.2023.110035_b2) 2019; 70
10.1016/j.comnet.2023.110035_b70
Barabási (10.1016/j.comnet.2023.110035_b33) 2013; 371
Zhou (10.1016/j.comnet.2023.110035_b9) 2020; 42
Minton (10.1016/j.comnet.2023.110035_b53) 2014
Zhu (10.1016/j.comnet.2023.110035_b63) 2020; 8
Ventruto (10.1016/j.comnet.2023.110035_b26) 2020; 12
Wellem (10.1016/j.comnet.2023.110035_b17) 2019; 7
Kulkarni (10.1016/j.comnet.2023.110035_b50) 2020
Lai (10.1016/j.comnet.2023.110035_b36) 2022; 10
Fontugne (10.1016/j.comnet.2023.110035_b71) 2011; 11
Huang (10.1016/j.comnet.2023.110035_b18) 2021; 29
Zarei (10.1016/j.comnet.2023.110035_b4) 2021; 131
Bundala (10.1016/j.comnet.2023.110035_b68) 2014
Jing (10.1016/j.comnet.2023.110035_b28) 2021; 19
Ding (10.1016/j.comnet.2023.110035_b34) 2021; 19
10.1016/j.comnet.2023.110035_b61
10.1016/j.comnet.2023.110035_b60
González (10.1016/j.comnet.2023.110035_b40) 2021
Saeed (10.1016/j.comnet.2023.110035_b10) 2022
Li (10.1016/j.comnet.2023.110035_b44) 2011
Metwally (10.1016/j.comnet.2023.110035_b57) 2006; 31
Mai (10.1016/j.comnet.2023.110035_b14) 2020; 35
Soto (10.1016/j.comnet.2023.110035_b51) 2023; 138
da Silveira Ilha (10.1016/j.comnet.2023.110035_b39) 2020; 18
Lai (10.1016/j.comnet.2023.110035_b42) 2020
Goldstein (10.1016/j.comnet.2023.110035_b65) 2004; 41
Lai (10.1016/j.comnet.2023.110035_b43) 2019
Patel (10.1016/j.comnet.2023.110035_b7) 2020; 9
Cormode (10.1016/j.comnet.2023.110035_b45) 2011; 29
10.1016/j.comnet.2023.110035_b59
Caraiani (10.1016/j.comnet.2023.110035_b5) 2021; 23
Clauset (10.1016/j.comnet.2023.110035_b66) 2009; 51
Ujjan (10.1016/j.comnet.2023.110035_b8) 2021; 13
References_xml – volume: 131
  year: 2021
  ident: b4
  article-title: Automatic seizure detection using orthogonal matching pursuit, discrete wavelet transform, and entropy based features of EEG signals
  publication-title: Comput. Biol. Med.
– start-page: 477
  year: 2011
  end-page: 496
  ident: b44
  article-title: A new algorithm for compressed counting with applications in shannon entropy estimation in dynamic data
  publication-title: Proceedings of the 24th Annual Conference on Learning Theory
– volume: 138
  start-page: 26
  year: 2023
  end-page: 42
  ident: b51
  article-title: JACC-FPGA: A hardware accelerator for jaccard similarity estimation using FPGAs in the cloud
  publication-title: Future Gener. Comput. Syst.
– year: 2012
  ident: b67
  article-title: Smhasher & murmurhash
– volume: 70
  start-page: 447
  year: 2019
  end-page: 489
  ident: b2
  article-title: A comprehensive survey on network anomaly detection
  publication-title: Telecommun. Syst.
– reference: H. Ringberg, A. Soule, J. Rexford, C. Diot, Sensitivity of PCA for traffic anomaly detection, in: Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2007, pp. 109–120.
– start-page: 141
  year: 2020
  end-page: 148
  ident: b30
  article-title: A hardware accelerator for entropy estimation using the top-k most frequent elements
  publication-title: 2020 23rd Euromicro Conference on Digital System Design
– volume: 23
  start-page: 1465
  year: 2021
  ident: b5
  article-title: Using entropy to evaluate the impact of monetary policy shocks on financial networks
  publication-title: Entropy
– volume: 82
  start-page: 58
  year: 2022
  end-page: 85
  ident: b23
  article-title: Applications of sketches in network traffic measurement: A survey
  publication-title: Inf. Fusion
– volume: 11
  start-page: 41
  year: 2011
  end-page: 51
  ident: b71
  article-title: A hough-transform-based anomaly detector with an adaptive time interval
  publication-title: ACM SIGAPP Appl. Comput. Rev.
– start-page: 974
  year: 2020
  end-page: 983
  ident: b52
  article-title: Universal online sketch for tracking heavy hitters and estimating moments of data streams
  publication-title: IEEE INFOCOM 2020-IEEE Conference on Computer Communications
– volume: 70
  start-page: 351
  year: 2017
  end-page: 365
  ident: b58
  article-title: An information-theoretic method for the detection of anomalies in network traffic
  publication-title: Comput. Secur.
– start-page: 137
  year: 2007
  end-page: 156
  ident: b27
  article-title: Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm
  publication-title: Discrete Mathematics and Theoretical Computer Science
– volume: 42
  start-page: 147
  year: 1974
  end-page: 174
  ident: b64
  article-title: The method of least squares and some alternatives. Part I, II, II, IV, V, VI
  publication-title: Int. Satistical Rev.
– start-page: 669
  year: 2014
  end-page: 686
  ident: b53
  article-title: Improved concentration bounds for count-sketch
  publication-title: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
– reference: G. Dewaele, K. Fukuda, P. Borgnat, P. Abry, K. Cho, Extracting hidden anomalies using sketch and non gaussian multiresolution statistical detection procedures, in: Proceedings of the 2007 Workshop on Large Scale Attack Defense, 2007, pp. 145–152.
– start-page: 218
  year: 2022
  end-page: 223
  ident: b10
  article-title: Network traffic classifications using gated recurrent units with weighted cross-entropy
  publication-title: 2022 14th International Conference on Computational Intelligence and Communication Networks
– volume: 2
  start-page: 143
  year: 1982
  end-page: 152
  ident: b56
  article-title: Finding repeated elements
  publication-title: Sci. Comput. Program
– reference: R. Fontugne, P. Borgnat, P. Abry, K. Fukuda, Mawilab: Combining diverse anomaly detectors for automated anomaly labeling and performance benchmarking, in: Proceedings of the 6th International Conference, 2010, pp. 1–12.
– volume: 10
  start-page: 104934
  year: 2022
  end-page: 104953
  ident: b36
  article-title: Tabular interpolation approach based on stable random projection for estimating empirical entropy of high-speed network traffic
  publication-title: IEEE Access
– volume: 31
  start-page: 1095
  year: 2006
  end-page: 1133
  ident: b57
  article-title: An integrated efficient solution for computing frequent and top-k elements in data streams
  publication-title: ACM Trans. Database Syst.
– volume: 9
  start-page: 923
  year: 2020
  ident: b7
  article-title: Network anomaly detection inside consumer networks—A hybrid approach
  publication-title: Electronics
– start-page: 1
  year: 2020
  end-page: 9
  ident: b15
  article-title: Estimating logarithmic and exponential functions to track network traffic entropy in P4
  publication-title: NOMS 2020-2020 IEEE/IFIP Network Operations and Management Symposium
– volume: 9
  start-page: 85823
  year: 2021
  end-page: 85838
  ident: b19
  article-title: A high-throughput hardware accelerator for network entropy estimation using sketches
  publication-title: IEEE Access
– reference: R. Harrison, Q. Cai, A. Gupta, J. Rexford, Network-wide heavy hitter detection with commodity switches, in: Proceedings of the Symposium on SDN Research, 2018, pp. 1–7.
– volume: 53
  start-page: 307
  year: 2006
  end-page: 323
  ident: b41
  article-title: Stable distributions, pseudorandom generators, embeddings, and data stream computation
  publication-title: J. ACM
– volume: 19
  start-page: 4019
  year: 2021
  end-page: 4031
  ident: b34
  article-title: Tracking normalized network traffic entropy to detect DDoS attacks in P4
  publication-title: IEEE Trans. Dependable Secure Comput.
– volume: 22
  start-page: 186
  year: 2020
  ident: b3
  article-title: A multiple Rényi entropy based intrusion detection system for connected vehicles
  publication-title: Entropy
– volume: 42
  start-page: 311
  year: 2020
  end-page: 323
  ident: b9
  article-title: Practical evaluation of encrypted traffic classification based on a combined method of entropy estimation and neural networks
  publication-title: ETRI J.
– volume: 129
  year: 2022
  ident: b20
  article-title: A survey on hardware accelerators: Taxonomy, trends, challenges, and perspectives
  publication-title: J. Syst. Archit.
– volume: 29
  start-page: 929
  year: 2017
  end-page: 942
  ident: b16
  article-title: Sketch acceleration on FPGA and its applications in network anomaly detection
  publication-title: IEEE Trans. Parallel Distrib. Syst.
– volume: 29
  start-page: 2073
  year: 2021
  end-page: 2086
  ident: b18
  article-title: Spread estimation with non-duplicate sampling in high-speed networks
  publication-title: IEEE/ACM Trans. Netw.
– volume: 2014
  start-page: 1
  year: 2014
  end-page: 11
  ident: b48
  article-title: How can sliding HyperLogLog and EWMA detect port scan attacks in IP traffic?
  publication-title: EURASIP J. Inf. Secur.
– volume: 26
  start-page: 2774
  year: 2018
  end-page: 2786
  ident: b24
  article-title: CountMax: A lightweight and cooperative sketch measurement for software-defined networks
  publication-title: IEEE/ACM Trans. Netw.
– reference: Z. Liu, A. Manousis, G. Vorsanger, V. Sekar, V. Braverman, One sketch to rule them all: Rethinking network flow monitoring with univmon, in: Proceedings of the 2016 ACM SIGCOMM Conference, 2016, pp. 101–114.
– volume: 58
  start-page: 137
  year: 1999
  end-page: 147
  ident: b37
  article-title: The space complexity of approximating the frequency moments
  publication-title: J. Comput. Syst. Sci.
– volume: 129
  year: 2022
  ident: b74
  article-title: CUPID: A labeled dataset with pentesting for evaluation of network intrusion detection
  publication-title: J. Syst. Archit.
– volume: 13
  start-page: 1522
  year: 2021
  ident: b8
  article-title: Entropy based features distribution for anti-DDoS model in sdn
  publication-title: Sustainability
– volume: 312
  start-page: 3
  year: 2004
  end-page: 15
  ident: b38
  article-title: Finding frequent items in data streams
  publication-title: Theoret. Comput. Sci.
– start-page: 326
  year: 2013
  end-page: 329
  ident: b69
  article-title: Parallelization of bitonic sort and radix sort algorithms on many core GPUs
  publication-title: 2013 International Conference on Electronics, Computer and Computation
– volume: 12
  start-page: 158
  year: 2020
  ident: b26
  article-title: On frequency estimation and detection of heavy hitters in data streams
  publication-title: Future Internet
– start-page: 1
  year: 2019
  end-page: 2
  ident: b43
  article-title: Sketch-based entropy estimation for network traffic analysis using programmable data plane ASICs
  publication-title: 2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems
– reference: Y. Zhao, K. Yang, Z. Liu, T. Yang, L. Chen, S. Liu, N. Zheng, R. Wang, H. Wu, Y. Wang, et al., {LightGuardian}: A {full-visibility}, lightweight, in-band telemetry system using sketchlets, in: 18th USENIX Symposium on Networked Systems Design and Implementation, NSDI 21, 2021, pp. 991–1010.
– volume: 27
  start-page: 379
  year: 1948
  end-page: 423
  ident: b1
  article-title: A mathematical theory of communication
  publication-title: Bell Syst. Tech. J.
– volume: 7
  start-page: 92476
  year: 2019
  end-page: 92498
  ident: b17
  article-title: A flexible sketch-based network traffic monitoring infrastructure
  publication-title: IEEE Access
– start-page: 2026
  year: 2019
  end-page: 2034
  ident: b21
  article-title: Mv-sketch: A fast and compact invertible sketch for heavy flow detection in network data streams
  publication-title: IEEE INFOCOM 2019-IEEE Conference on Computer Communications
– start-page: 393
  year: 2021
  end-page: 401
  ident: b40
  article-title: Bungee: An adaptive pushback mechanism for DDoS detection and mitigation in p4 data planes
  publication-title: 2021 IFIP/IEEE International Symposium on Integrated Network Management
– reference: S. Heule, M. Nunkesser, A. Hall, Hyperloglog in practice: Algorithmic engineering of a state of the art cardinality estimation algorithm, in: Proceedings of the 16th International Conference on Extending Database Technology, 2013, pp. 683–692.
– volume: 92
  start-page: 300
  year: 2023
  end-page: 312
  ident: b22
  article-title: ExtendedSketch+: Super host identification and network host trust evaluation with memory efficiency and high accuracy
  publication-title: Inf. Fusion
– volume: 19
  start-page: 2741
  year: 2021
  end-page: 2754
  ident: b28
  article-title: SuperSketch: A multi-dimensional reversible data structure for super host identification
  publication-title: IEEE Trans. Dependable Secure Comput.
– year: 2008
  ident: b31
  article-title: The CAIDA UCSD anonymized internet traces
– start-page: 1251
  year: 2020
  end-page: 1260
  ident: b54
  article-title: Faster and more accurate measurement through additive-error counters
  publication-title: IEEE INFOCOM 2020-IEEE Conference on Computer Communications
– reference: A. Goyal, H. Daumé III, G. Cormode, 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, 2012, pp. 1093–1103.
– volume: 116
  start-page: 96
  year: 2017
  end-page: 110
  ident: b6
  article-title: Detection of DDoS attacks and flash events using novel information theory metrics
  publication-title: Comput. Netw.
– start-page: 19
  year: 2019
  end-page: 27
  ident: b35
  article-title: Offloading real-time DDoS attack detection to programmable data planes
  publication-title: 2019 IFIP/IEEE Symposium on Integrated Network and Service Management
– reference: D. Brauckhoff, X. Dimitropoulos, A. Wagner, K. Salamatian, Anomaly extraction in backbone networks using association rules, in: Proceedings of the 9th ACM SIGCOMM Conference on Internet Measurement, 2009, pp. 28–34.
– volume: 201
  year: 2021
  ident: b75
  article-title: OrderSketch: An unbiased and fast sketch for frequency estimation of data streams
  publication-title: Comput. Netw.
– volume: 25
  start-page: 701
  year: 2023
  end-page: 761
  ident: b13
  article-title: A survey on in-network computing: Programmable data plane and technology specific applications
  publication-title: IEEE Commun. Surv. Tutor.
– volume: 35
  start-page: 289
  year: 2020
  end-page: 295
  ident: b14
  article-title: In-network computing powered mobile edge: Toward high performance industrial IoT
  publication-title: IEEE Netw.
– volume: 371
  year: 2013
  ident: b33
  article-title: Network science
  publication-title: Phil. Trans. R. Soc. A
– year: 2020
  ident: b62
  article-title: IoT-23: A labeled dataset with malicious and benign IoT network traffic (version 1.0.0) [data set]. Zenodo
– volume: 41
  start-page: 255
  year: 2004
  end-page: 258
  ident: b65
  article-title: Problems with fitting to the power-law distribution
  publication-title: Eur. Phys. J. B
– volume: 34
  start-page: 145
  year: 2006
  end-page: 156
  ident: b11
  article-title: Data streaming algorithms for estimating entropy of network traffic
  publication-title: ACM SIGMETRICS Perform. Eval. Rev.
– start-page: 1566
  year: 2020
  end-page: 1570
  ident: b42
  article-title: Real-time ddos attack detection using sketch-based entropy estimation on the netfpga sume platform
  publication-title: 2020 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference
– volume: 226
  year: 2023
  ident: b29
  article-title: A survey on sliding window sketch for network measurement
  publication-title: Comput. Netw.
– volume: 8
  start-page: 114715
  year: 2020
  end-page: 114732
  ident: b76
  article-title: Mining discriminative k-mers in dna sequences using sketches and hardware acceleration
  publication-title: IEEE Access
– volume: 51
  start-page: 661
  year: 2009
  end-page: 703
  ident: b66
  article-title: Power-law distributions in empirical data
  publication-title: SIAM Rev.
– start-page: 196
  year: 2013
  end-page: 206
  ident: b12
  article-title: A simple sketching algorithm for entropy estimation over streaming data
  publication-title: Artificial Intelligence and Statistics
– volume: 217
  year: 2022
  ident: b55
  article-title: Analyzing count min sketch with conservative updates
  publication-title: Comput. Netw.
– start-page: 236
  year: 2014
  end-page: 247
  ident: b68
  article-title: Optimal sorting networks
  publication-title: International Conference on Language and Automata Theory and Applications
– volume: 101
  start-page: 770
  year: 2019
  end-page: 784
  ident: b25
  article-title: CMSS: Sketching based reliable tracking of large network flows
  publication-title: Future Gener. Comput. Syst.
– volume: 29
  start-page: 64
  year: 2011
  end-page: 69
  ident: b45
  article-title: Approximating data with the count-min sketch
  publication-title: IEEE Software
– volume: 8
  start-page: 47713
  year: 2020
  end-page: 47719
  ident: b63
  article-title: Power law and dimension of the maximum value for belief distribution with the maximum deng entropy
  publication-title: IEEE Access
– reference: T. Yang, J. Jiang, P. Liu, Q. Huang, J. Gong, Y. Zhou, R. Miao, X. Li, S. Uhlig, Elastic sketch: Adaptive and fast network-wide measurements, in: Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018, pp. 561–575.
– start-page: 47
  year: 2020
  end-page: 56
  ident: b50
  article-title: Hyperloglog sketch acceleration on fpga
  publication-title: 2020 30th International Conference on Field-Programmable Logic and Applications
– volume: 18
  start-page: 3121
  year: 2020
  end-page: 3139
  ident: b39
  article-title: Euclid: A fully in-network, P4-based approach for real-time DDoS attack detection and mitigation
  publication-title: IEEE Trans. Netw. Serv. Manag.
– volume: 226
  year: 2023
  ident: 10.1016/j.comnet.2023.110035_b29
  article-title: A survey on sliding window sketch for network measurement
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2023.109696
– start-page: 137
  year: 2007
  ident: 10.1016/j.comnet.2023.110035_b27
  article-title: Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm
– ident: 10.1016/j.comnet.2023.110035_b47
  doi: 10.1145/3185467.3185476
– start-page: 196
  year: 2013
  ident: 10.1016/j.comnet.2023.110035_b12
  article-title: A simple sketching algorithm for entropy estimation over streaming data
– volume: 138
  start-page: 26
  year: 2023
  ident: 10.1016/j.comnet.2023.110035_b51
  article-title: JACC-FPGA: A hardware accelerator for jaccard similarity estimation using FPGAs in the cloud
  publication-title: Future Gener. Comput. Syst.
  doi: 10.1016/j.future.2022.08.005
– volume: 217
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b55
  article-title: Analyzing count min sketch with conservative updates
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2022.109315
– volume: 29
  start-page: 929
  issue: 4
  year: 2017
  ident: 10.1016/j.comnet.2023.110035_b16
  article-title: Sketch acceleration on FPGA and its applications in network anomaly detection
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/TPDS.2017.2766633
– start-page: 1251
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b54
  article-title: Faster and more accurate measurement through additive-error counters
– volume: 7
  start-page: 92476
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b17
  article-title: A flexible sketch-based network traffic monitoring infrastructure
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2927863
– start-page: 1566
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b42
  article-title: Real-time ddos attack detection using sketch-based entropy estimation on the netfpga sume platform
– start-page: 2026
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b21
  article-title: Mv-sketch: A fast and compact invertible sketch for heavy flow detection in network data streams
– volume: 10
  start-page: 104934
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b36
  article-title: Tabular interpolation approach based on stable random projection for estimating empirical entropy of high-speed network traffic
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2022.3210336
– volume: 2
  start-page: 143
  issue: 2
  year: 1982
  ident: 10.1016/j.comnet.2023.110035_b56
  article-title: Finding repeated elements
  publication-title: Sci. Comput. Program
  doi: 10.1016/0167-6423(82)90012-0
– ident: 10.1016/j.comnet.2023.110035_b60
  doi: 10.1145/3230543.3230544
– ident: 10.1016/j.comnet.2023.110035_b32
  doi: 10.1145/1921168.1921179
– volume: 13
  start-page: 1522
  issue: 3
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b8
  article-title: Entropy based features distribution for anti-DDoS model in sdn
  publication-title: Sustainability
  doi: 10.3390/su13031522
– volume: 70
  start-page: 351
  year: 2017
  ident: 10.1016/j.comnet.2023.110035_b58
  article-title: An information-theoretic method for the detection of anomalies in network traffic
  publication-title: Comput. Secur.
  doi: 10.1016/j.cose.2017.07.004
– volume: 70
  start-page: 447
  issue: 3
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b2
  article-title: A comprehensive survey on network anomaly detection
  publication-title: Telecommun. Syst.
  doi: 10.1007/s11235-018-0475-8
– volume: 35
  start-page: 289
  issue: 1
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b14
  article-title: In-network computing powered mobile edge: Toward high performance industrial IoT
  publication-title: IEEE Netw.
  doi: 10.1109/MNET.021.2000318
– volume: 42
  start-page: 311
  issue: 3
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b9
  article-title: Practical evaluation of encrypted traffic classification based on a combined method of entropy estimation and neural networks
  publication-title: ETRI J.
  doi: 10.4218/etrij.2019-0190
– volume: 201
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b75
  article-title: OrderSketch: An unbiased and fast sketch for frequency estimation of data streams
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2021.108563
– start-page: 974
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b52
  article-title: Universal online sketch for tracking heavy hitters and estimating moments of data streams
– volume: 312
  start-page: 3
  issue: 1
  year: 2004
  ident: 10.1016/j.comnet.2023.110035_b38
  article-title: Finding frequent items in data streams
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(03)00400-6
– ident: 10.1016/j.comnet.2023.110035_b73
  doi: 10.1145/1644893.1644897
– start-page: 218
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b10
  article-title: Network traffic classifications using gated recurrent units with weighted cross-entropy
– volume: 58
  start-page: 137
  issue: 1
  year: 1999
  ident: 10.1016/j.comnet.2023.110035_b37
  article-title: The space complexity of approximating the frequency moments
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1997.1545
– volume: 23
  start-page: 1465
  issue: 11
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b5
  article-title: Using entropy to evaluate the impact of monetary policy shocks on financial networks
  publication-title: Entropy
  doi: 10.3390/e23111465
– volume: 129
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b20
  article-title: A survey on hardware accelerators: Taxonomy, trends, challenges, and perspectives
  publication-title: J. Syst. Archit.
  doi: 10.1016/j.sysarc.2022.102561
– ident: 10.1016/j.comnet.2023.110035_b70
  doi: 10.1145/1352664.1352675
– volume: 34
  start-page: 145
  issue: 1
  year: 2006
  ident: 10.1016/j.comnet.2023.110035_b11
  article-title: Data streaming algorithms for estimating entropy of network traffic
  publication-title: ACM SIGMETRICS Perform. Eval. Rev.
  doi: 10.1145/1140103.1140295
– start-page: 393
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b40
  article-title: Bungee: An adaptive pushback mechanism for DDoS detection and mitigation in p4 data planes
– year: 2012
  ident: 10.1016/j.comnet.2023.110035_b67
– ident: 10.1016/j.comnet.2023.110035_b46
– volume: 42
  start-page: 147
  year: 1974
  ident: 10.1016/j.comnet.2023.110035_b64
  article-title: The method of least squares and some alternatives. Part I, II, II, IV, V, VI
  publication-title: Int. Satistical Rev.
– start-page: 47
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b50
  article-title: Hyperloglog sketch acceleration on fpga
– year: 2008
  ident: 10.1016/j.comnet.2023.110035_b31
– volume: 116
  start-page: 96
  year: 2017
  ident: 10.1016/j.comnet.2023.110035_b6
  article-title: Detection of DDoS attacks and flash events using novel information theory metrics
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2017.02.015
– volume: 26
  start-page: 2774
  issue: 6
  year: 2018
  ident: 10.1016/j.comnet.2023.110035_b24
  article-title: CountMax: A lightweight and cooperative sketch measurement for software-defined networks
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2018.2877700
– volume: 18
  start-page: 3121
  issue: 3
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b39
  article-title: Euclid: A fully in-network, P4-based approach for real-time DDoS attack detection and mitigation
  publication-title: IEEE Trans. Netw. Serv. Manag.
  doi: 10.1109/TNSM.2020.3048265
– start-page: 236
  year: 2014
  ident: 10.1016/j.comnet.2023.110035_b68
  article-title: Optimal sorting networks
– start-page: 1
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b15
  article-title: Estimating logarithmic and exponential functions to track network traffic entropy in P4
– volume: 82
  start-page: 58
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b23
  article-title: Applications of sketches in network traffic measurement: A survey
  publication-title: Inf. Fusion
  doi: 10.1016/j.inffus.2021.12.007
– volume: 101
  start-page: 770
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b25
  article-title: CMSS: Sketching based reliable tracking of large network flows
  publication-title: Future Gener. Comput. Syst.
  doi: 10.1016/j.future.2019.07.031
– volume: 9
  start-page: 85823
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b19
  article-title: A high-throughput hardware accelerator for network entropy estimation using sketches
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2021.3088500
– volume: 29
  start-page: 64
  issue: 1
  year: 2011
  ident: 10.1016/j.comnet.2023.110035_b45
  article-title: Approximating data with the count-min sketch
  publication-title: IEEE Software
  doi: 10.1109/MS.2011.127
– start-page: 326
  year: 2013
  ident: 10.1016/j.comnet.2023.110035_b69
  article-title: Parallelization of bitonic sort and radix sort algorithms on many core GPUs
– volume: 22
  start-page: 186
  issue: 2
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b3
  article-title: A multiple Rényi entropy based intrusion detection system for connected vehicles
  publication-title: Entropy
  doi: 10.3390/e22020186
– volume: 19
  start-page: 2741
  issue: 4
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b28
  article-title: SuperSketch: A multi-dimensional reversible data structure for super host identification
  publication-title: IEEE Trans. Dependable Secure Comput.
  doi: 10.1109/TDSC.2021.3072295
– volume: 27
  start-page: 379
  issue: 3
  year: 1948
  ident: 10.1016/j.comnet.2023.110035_b1
  article-title: A mathematical theory of communication
  publication-title: Bell Syst. Tech. J.
  doi: 10.1002/j.1538-7305.1948.tb01338.x
– volume: 2014
  start-page: 1
  year: 2014
  ident: 10.1016/j.comnet.2023.110035_b48
  article-title: How can sliding HyperLogLog and EWMA detect port scan attacks in IP traffic?
  publication-title: EURASIP J. Inf. Secur.
– volume: 41
  start-page: 255
  issue: 2
  year: 2004
  ident: 10.1016/j.comnet.2023.110035_b65
  article-title: Problems with fitting to the power-law distribution
  publication-title: Eur. Phys. J. B
  doi: 10.1140/epjb/e2004-00316-5
– volume: 8
  start-page: 114715
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b76
  article-title: Mining discriminative k-mers in dna sequences using sketches and hardware acceleration
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2020.3003918
– volume: 29
  start-page: 2073
  issue: 5
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b18
  article-title: Spread estimation with non-duplicate sampling in high-speed networks
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/TNET.2021.3078725
– volume: 19
  start-page: 4019
  issue: 6
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b34
  article-title: Tracking normalized network traffic entropy to detect DDoS attacks in P4
  publication-title: IEEE Trans. Dependable Secure Comput.
  doi: 10.1109/TDSC.2021.3116345
– volume: 8
  start-page: 47713
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b63
  article-title: Power law and dimension of the maximum value for belief distribution with the maximum deng entropy
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2020.2979060
– volume: 131
  year: 2021
  ident: 10.1016/j.comnet.2023.110035_b4
  article-title: Automatic seizure detection using orthogonal matching pursuit, discrete wavelet transform, and entropy based features of EEG signals
  publication-title: Comput. Biol. Med.
  doi: 10.1016/j.compbiomed.2021.104250
– start-page: 669
  year: 2014
  ident: 10.1016/j.comnet.2023.110035_b53
  article-title: Improved concentration bounds for count-sketch
– volume: 371
  issue: 1987
  year: 2013
  ident: 10.1016/j.comnet.2023.110035_b33
  article-title: Network science
  publication-title: Phil. Trans. R. Soc. A
  doi: 10.1098/rsta.2012.0375
– ident: 10.1016/j.comnet.2023.110035_b61
– volume: 31
  start-page: 1095
  issue: 3
  year: 2006
  ident: 10.1016/j.comnet.2023.110035_b57
  article-title: An integrated efficient solution for computing frequent and top-k elements in data streams
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/1166074.1166084
– volume: 129
  year: 2022
  ident: 10.1016/j.comnet.2023.110035_b74
  article-title: CUPID: A labeled dataset with pentesting for evaluation of network intrusion detection
  publication-title: J. Syst. Archit.
  doi: 10.1016/j.sysarc.2022.102621
– volume: 53
  start-page: 307
  issue: 3
  year: 2006
  ident: 10.1016/j.comnet.2023.110035_b41
  article-title: Stable distributions, pseudorandom generators, embeddings, and data stream computation
  publication-title: J. ACM
  doi: 10.1145/1147954.1147955
– start-page: 477
  year: 2011
  ident: 10.1016/j.comnet.2023.110035_b44
  article-title: A new algorithm for compressed counting with applications in shannon entropy estimation in dynamic data
– volume: 9
  start-page: 923
  issue: 6
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b7
  article-title: Network anomaly detection inside consumer networks—A hybrid approach
  publication-title: Electronics
  doi: 10.3390/electronics9060923
– year: 2020
  ident: 10.1016/j.comnet.2023.110035_b62
– volume: 11
  start-page: 41
  issue: 3
  year: 2011
  ident: 10.1016/j.comnet.2023.110035_b71
  article-title: A hough-transform-based anomaly detector with an adaptive time interval
  publication-title: ACM SIGAPP Appl. Comput. Rev.
  doi: 10.1145/2034594.2034598
– start-page: 1
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b43
  article-title: Sketch-based entropy estimation for network traffic analysis using programmable data plane ASICs
– ident: 10.1016/j.comnet.2023.110035_b59
  doi: 10.1145/2934872.2934906
– start-page: 19
  year: 2019
  ident: 10.1016/j.comnet.2023.110035_b35
  article-title: Offloading real-time DDoS attack detection to programmable data planes
– ident: 10.1016/j.comnet.2023.110035_b72
  doi: 10.1145/1254882.1254895
– volume: 12
  start-page: 158
  issue: 9
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b26
  article-title: On frequency estimation and detection of heavy hitters in data streams
  publication-title: Future Internet
  doi: 10.3390/fi12090158
– ident: 10.1016/j.comnet.2023.110035_b49
  doi: 10.1145/2452376.2452456
– volume: 51
  start-page: 661
  issue: 4
  year: 2009
  ident: 10.1016/j.comnet.2023.110035_b66
  article-title: Power-law distributions in empirical data
  publication-title: SIAM Rev.
  doi: 10.1137/070710111
– start-page: 141
  year: 2020
  ident: 10.1016/j.comnet.2023.110035_b30
  article-title: A hardware accelerator for entropy estimation using the top-k most frequent elements
– volume: 25
  start-page: 701
  issue: 1
  year: 2023
  ident: 10.1016/j.comnet.2023.110035_b13
  article-title: A survey on in-network computing: Programmable data plane and technology specific applications
  publication-title: IEEE Commun. Surv. Tutor.
  doi: 10.1109/COMST.2022.3213237
– volume: 92
  start-page: 300
  year: 2023
  ident: 10.1016/j.comnet.2023.110035_b22
  article-title: ExtendedSketch+: Super host identification and network host trust evaluation with memory efficiency and high accuracy
  publication-title: Inf. Fusion
  doi: 10.1016/j.inffus.2022.12.009
SSID ssj0004428
Score 2.4118693
Snippet The empirical entropy is used in network traffic monitoring and classification to detect anomalous events and manage network resources. Computing the entropy...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 110035
SubjectTerms Hardware acceleration
Shannon empirical entropy
Sketch-based streaming algorithms
Title A streaming algorithm and hardware accelerator to estimate the empirical entropy of network flows
URI https://dx.doi.org/10.1016/j.comnet.2023.110035
Volume 237
WOSCitedRecordID wos001089108200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-7069
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004428
  issn: 1389-1286
  databaseCode: AIEXJ
  dateStart: 19990114
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQc4IJ5qeckHblVW3ThZx8cIFgGHqlIL2p4iZ2zDVrvJqg2lf4t_yPiVDRRV9MAlipzYjjxf7PF45htC3kCmgc-ESgAYJPgnFkl9UKik0FKqFDhnQrlkE_zwsFgsxNFo9DPGwlyueNMUV1di819FjWUobBs6ewtx941iAd6j0PGKYsfrPwm-dPEfcu2iD1dfW9z9f_N5MGyA1Q_r6SUBcLVxB-xW97REG6i4au_gsd4sPW2Itfu2G8847Z3F982qDUp4JDcISSHiG86GW64t-4IKUNtGFAfzgxAD84O1Y7vD-mk0Zp_K5bpH23Hb-aMh6cJi5pP44It2CZL2j1vjqr_rl5cj3Pz7SqfyYh3numDYSNnAScTPxahLYVlgyg6TdeopYsJ0a_nuPNvJtZXAGyXOrCBxBCa2g8n29d-Jt_9YEHs3xegBd1b5VirbSuVbuUN2Up6LYkx2yo_zxadtMG7mEvr2Xx_jNZ1T4fWv-bs-NNBxTh6SB2FzQksPqkdkpJvH5P6AsvIJkSXt4UV7eFEUL43wogN40a6lEV4UgUB7eNEAL9oaGsBDHbyeks_v5ydvPyQhTUcCuB_tEjAiyw8MFAwyrlWRc5NOTT4DAXKmCy5B5bzO8a8XIoXMTAVXwkBqciYtlxR7RsZN2-hdQnPIZA2CodIrMxB5XctaMcZUplHNV3yPJHGwqo1nY6luEtIe4XFEq6BRek2xQpjcWPP5LXt6Qe5tMfySjLvz7_oVuQuX3fLi_HXAyC8RP5ro
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+streaming+algorithm+and+hardware+accelerator+to+estimate+the+empirical+entropy+of+network+flows&rft.jtitle=Computer+networks+%28Amsterdam%2C+Netherlands+%3A+1999%29&rft.au=Fern%C3%A1ndez%2C+Yaime&rft.au=Soto%2C+Javier+E.&rft.au=Vera%2C+Sof%C3%ADa&rft.au=Prieto%2C+Yasmany&rft.date=2023-12-01&rft.issn=1389-1286&rft.volume=237&rft.spage=110035&rft_id=info:doi/10.1016%2Fj.comnet.2023.110035&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_comnet_2023_110035
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-1286&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-1286&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-1286&client=summon