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 neurofuzzy networks trained by PARC algorithm, showing that it achieves very high accuracy, in line with the best performing algorithms on Weka, by considering two traffic data sets collected in different epochs and places. It turns out that required classification model complexity is much lower with Min-Max networks with respect to SVM models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.
Low complexity, high performance neuro-fuzzy system for Internet traffic flows early / Rizzi, Antonello; Colabrese, Silvia; Baiocchi, Andrea. - 2013:(2013), pp. 77-82. (Intervento presentato al convegno 9th International Wireless Communications and Mobile Computing Conference (IWCMC) tenutosi a Cagliari; Italy) [10.1109/iwcmc.2013.6583538].
Low complexity, high performance neuro-fuzzy system for Internet traffic flows early
RIZZI, Antonello;COLABRESE, SILVIA;BAIOCCHI, Andrea
2013
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 neurofuzzy networks trained by PARC algorithm, showing that it achieves very high accuracy, in line with the best performing algorithms on Weka, by considering two traffic data sets collected in different epochs and places. It turns out that required classification model complexity is much lower with Min-Max networks with respect to SVM models, enabling the implementation of effective classification algorithms in real time on inexpensive platforms.File | Dimensione | Formato | |
---|---|---|---|
Rizzi_Low-complexity_2013.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
483.43 kB
Formato
Adobe PDF
|
483.43 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.