Latest revision as of 15:37, 3 February 2021

Abstract

International audience; The crucial future role of Internet in society makes of network monitoring a critical issue for network operators in future network scenarios. The Future Internet will have to cope with new and different anomalies, motivating the development of accurate detection algorithms. This paper presents a novel approach to detect unexpected and large traffic variations in data networks. We introduce an optimal volume anomaly detection algorithm in which the anomaly-free traffic is treated as a nuisance parameter. The algorithm relies on an original parsimonious model for traffic demands which allows detecting anomalies from link traffic measurements, reducing the overhead of data collection. The performance of the method is compared to that obtained with the Principal Components Analysis (PCA) approach. We choose this method as benchmark given its relevance in the anomaly detection literature. Our proposal is validated using data from an operational network, showing how the method outperforms the PCA approach.

Original document

The different versions of the original document can be found in:

• https://hal.archives-ouvertes.fr/hal-00486765

• http://link.springer.com/content/pdf/10.1007/978-3-642-04576-9.pdf,

http://link.springer.com/content/pdf/10.1007/978-3-642-04576-9,

http://dx.doi.org/10.1007/978-3-642-04576-9 under the license http://www.springer.com/tdm

• http://link.springer.com/content/pdf/10.1007/978-3-642-04576-9_7,

http://dx.doi.org/10.1007/978-3-642-04576-9_7 under the license http://www.springer.com/tdm

• https://link.springer.com/chapter/10.1007/978-3-642-04576-9_7,

https://hal.archives-ouvertes.fr/hal-00486765,

https://dblp.uni-trier.de/db/conf/fitramen/fitramen2008.html#CasasFVN08,

https://rd.springer.com/chapter/10.1007/978-3-642-04576-9_7,

https://academic.microsoft.com/#/detail/2294670126

• https://ui.adsabs.harvard.edu/abs/2009LNCS.5464.....V/abstract,

https://academic.microsoft.com/#/detail/2615588901

• [ ]

DOIS: 10.1007/978-3-642-04576-9 10.1007/978-3-642-04576-9_7