NADA – Network Anomaly Detection Algorithm
- Cite this paper as:
- Farraposo S., Owezarski P., Monteiro E. (2007) NADA – Network Anomaly Detection Algorithm. In: Clemm A., Granville L.Z., Stadler R. (eds) Managing Virtualization of Networks and Services. DSOM 2007. Lecture Notes in Computer Science, vol 4785. Springer, Berlin, Heidelberg
This paper deals with a new iterative Network Anomaly Detection Algorithm – NADA, which accomplishes the detection, classification and identification of traffic anomalies. NADA fully provides all information required limiting the extent of anomalies by locating them in time, by classifying them, and identifying their features as, for instance, the source and destination addresses and ports involved. To reach its goal, NADA uses a generic multi-featured algorithm executed at different time scales and at different levels of IP aggregation. Besides that, the NADA approach contributes to the definition of a set of traffic anomaly behavior-based signatures. The use of these signatures makes NADA suitable and efficient to use in a monitoring environment.