A scheme for fast network traffic anomaly detection

Fast network traffic anomaly detection is an important issue in network security. At present, the Internet environment becomes more and more complex than ever before. The unexpected anomaly occurs constantly, which brings great loss to Internet services. This makes people put forward higher requirements for the speed and real-time of network traffic anomaly detection. How to quickly perceive the traffic anomaly is a new demand in the network anomaly detection. Due to the shortage of the conventional detection methods in terms of speed, a fast anomaly detection scheme is proposed in this paper, which is based on the iterative estimation of Hurst parameter. The anomaly can be determined through the value of estimation. Meanwhile, by on-line we can estimate continuously and refresh the value of Hurst according to the latest network traffic, and then we can get the latest traffic data and speed up the process of anomaly detection. Analyses show that this scheme is effective in fast anomaly detection.