2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems 2011
DOI: 10.1109/mascots.2011.65
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing Per-Application Network Traffic Using Entropy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…Using entropy to characterize per-application network traffic, Petkov et al [31] estimated the entropy of difference streaming scenarios and divided them into categories of entropy measurement from the lowest to the highest. The entropy rate of a sequence is a measure of how predictable a sequence is based on past observations.…”
Section: Related Workmentioning
confidence: 99%
“…Using entropy to characterize per-application network traffic, Petkov et al [31] estimated the entropy of difference streaming scenarios and divided them into categories of entropy measurement from the lowest to the highest. The entropy rate of a sequence is a measure of how predictable a sequence is based on past observations.…”
Section: Related Workmentioning
confidence: 99%
“…In their papers, the complexity of wired and wireless traffic is analyzed and compared with fractal analysis results. Unlike the work of Riihijarvi et al's, Petkov et al [16] focused on the per-application flow traffic. The plug-in packet timing entropy (PPTEn) is used as an estimator to investigate the complexity of per-flow network traffic.…”
Section: Introductionmentioning
confidence: 98%