A Data Streaming Method for Monitoring Host Connection Degrees of High-Speed Links
Authors:
- 7 March 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 6 (3) , 1086-1098
Abstract
Due to the massive amount of data in high-speed network traffic and the limit on processing capability, it is a great challenge to accurately measure and monitor network traffic over high-speed links online. A new data structure is presented in this paper for locating the hosts associated with large connection degrees or significant changes in connection degrees based on the reversible connection degree sketch to monitor anomalous network traffic. The reversible connection degree sketch builds a compact summary of host connection degrees efficiently and accurately. For each packet coming, it only needs to set several bits selected in a bit array by a group of hash functions. These hash functions are designed based on the Chinese Remainder Theorem so that the in-degree or out-degree associated with a given host can be accurately estimated. With this new data structure, we develop a new reverse sketch method for locating abnormal hosts. Although the reversible connection degree sketch does not preserve any host address information, we can analytically reconstruct the host addresses associated with large connection degrees or significant changes in connection degrees by a simple calculation purely based on the characteristics of the hash functions. Furthermore, a reinforced reversible connection degree sketch, the double connection degree sketch, is developed to reduce false positives which are commonly encountered in the sketch-based methods. A traffic monitoring system based on this double connection degree is developed to detect and classify the abnormal hosts associated with large connection degrees or significant changes in connection degrees. The experiments are conducted based on the actual network traffic and the testing results show that our method is accurate and efficient.Keywords
This publication has 25 references indexed in Scilit:
- CR-precis: A Deterministic Summary Structure for Update Data StreamsLecture Notes in Computer Science, 2007
- A data streaming algorithm for estimating subpopulation flow size distribution2005
- What's hot and what's not: tracking most frequent items dynamicallyACM Transactions on Database Systems, 2005
- Joint data streaming and sampling techniques for detection of super sources and destinations2005
- Change-point monitoring for the detection of DoS attacksIEEE Transactions on Dependable and Secure Computing, 2004
- Bitmap algorithms for counting active flows on high speed links2003
- Deriving traffic demands for operational IP networks: methodology and experienceIEEE/ACM Transactions on Networking, 2001
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970