Traffic flow classification to identify applications and activity of users is widely studied both to understand privacy threats and to support network functions such as usage policies and QoS. For those needs, real time classification is required and classifier’s complexity is as important as accuracy, especially given the increasing link speeds also in the access section of the network. We propose the application of a highly efficient classification system, specifically Min-Max neuro-fuzzy networks trained by PARC algorithm, and compare it with popular classification systems, by considering traffic data sets collected in different epochs and places. We show that Min-Max networks achieve high accuracy, in line with the best performing algorithms on Weka (SVM, Random Tree, Random Forest). The required classification model complexity is much lower with Min-Max networks with respect to the other models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.

Traffic flow classification to identify applications and activity of users is widely studied both to understand privacy threats and to support network functions such as usage policies and QoS. For those needs, real time classification is required and classifier’s complexity is as important as accuracy, especially given the increasing link speeds also in the access section of the network. We propose the application of a highly efficient classification system, specifically Min-Max neuro-fuzzy networks trained by PARC algorithm, and compare it with popular classification systems, by considering traffic data sets collected in different epochs and places. We show that Min-Max networks achieve high accuracy, in line with the best performing algorithms on Weka (SVM, Random Tree, Random Forest). The required classification model complexity is much lower with Min-Max networks with respect to the other models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.

A low complexity real-time Internet traffic flows neuro-fuzzy classifier / Rizzi, Antonello; Iacovazzi, Alfonso; Baiocchi, Andrea; Colabrese, Silvia. - In: COMPUTER NETWORKS. - ISSN 1389-1286. - STAMPA. - 91:(2015), pp. 752-771. [10.1016/j.comnet.2015.09.011]

A low complexity real-time Internet traffic flows neuro-fuzzy classifier

RIZZI, Antonello;IACOVAZZI, ALFONSO;BAIOCCHI, Andrea;
2015

Abstract

Traffic flow classification to identify applications and activity of users is widely studied both to understand privacy threats and to support network functions such as usage policies and QoS. For those needs, real time classification is required and classifier’s complexity is as important as accuracy, especially given the increasing link speeds also in the access section of the network. We propose the application of a highly efficient classification system, specifically Min-Max neuro-fuzzy networks trained by PARC algorithm, and compare it with popular classification systems, by considering traffic data sets collected in different epochs and places. We show that Min-Max networks achieve high accuracy, in line with the best performing algorithms on Weka (SVM, Random Tree, Random Forest). The required classification model complexity is much lower with Min-Max networks with respect to the other models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.
2015
Traffic flow classification to identify applications and activity of users is widely studied both to understand privacy threats and to support network functions such as usage policies and QoS. For those needs, real time classification is required and classifier’s complexity is as important as accuracy, especially given the increasing link speeds also in the access section of the network. We propose the application of a highly efficient classification system, specifically Min-Max neuro-fuzzy networks trained by PARC algorithm, and compare it with popular classification systems, by considering traffic data sets collected in different epochs and places. We show that Min-Max networks achieve high accuracy, in line with the best performing algorithms on Weka (SVM, Random Tree, Random Forest). The required classification model complexity is much lower with Min-Max networks with respect to the other models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.
Traffic flow classification; machine learning; neurofuzzy networks; features selection; genetic algorithms; classifier complexity; FPGA
01 Pubblicazione su rivista::01a Articolo in rivista
A low complexity real-time Internet traffic flows neuro-fuzzy classifier / Rizzi, Antonello; Iacovazzi, Alfonso; Baiocchi, Andrea; Colabrese, Silvia. - In: COMPUTER NETWORKS. - ISSN 1389-1286. - STAMPA. - 91:(2015), pp. 752-771. [10.1016/j.comnet.2015.09.011]
File allegati a questo prodotto
File Dimensione Formato  
Rizzi_Low-complexity_2015.pdf

solo utenti autorizzati

Note: A low complexity real-time Internet traffic flows neuro-fuzzy classifier
Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.74 MB
Formato Adobe PDF
1.74 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/793906
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 12
social impact