2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE) 2010
DOI: 10.1109/icacte.2010.5579013
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic application flow cluster based on traffic behavior distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…flowscount is #flows from the client-end to server-end within t interval . Euclidean Distance is the most common choice in clustering flow behavior [19,25,26], as authors usually assume data is ditributed in spherical structures. However, we have discovered that most serverside applications constrain the size or type of their returning content of different requests and linear structures dominates our feature space in flow monitoring.…”
Section: Automatic Server Discovery and Access Flowsmentioning
confidence: 99%
“…flowscount is #flows from the client-end to server-end within t interval . Euclidean Distance is the most common choice in clustering flow behavior [19,25,26], as authors usually assume data is ditributed in spherical structures. However, we have discovered that most serverside applications constrain the size or type of their returning content of different requests and linear structures dominates our feature space in flow monitoring.…”
Section: Automatic Server Discovery and Access Flowsmentioning
confidence: 99%