Affiliation:
1. Huazhong Agricultural University
Abstract
In the research area of network security, we often need to analyze the Internet traffic in real time. But the Internet traffic is usually very heavy, so it is very hard for us to analysis each packet one by one. Alternatively, analyzing the Internet traffic on flow level is often employed. Before analyzing the traffic flows, how we can fast construct and update these flows is a key issue. To solve this issue, in this paper, we propose a fast connection construction and update algorithm. Firstly, we define bidirectional flows as connection. Then, we use hash table to store the connection records and use this connection construction and update algorithm to ensure that these connection records can to be stored in memory in heavy traffic environment to achieve real-time traffic analysis. At last, the experiments show that the algorithm we proposed is efficient and can meet the traffic analysis need.
Publisher
Trans Tech Publications, Ltd.
Reference7 articles.
1. P. Danielis, M. Gotzmann, D. Timmermann et al., A Peer-To-Peer-based Storage Platform for Storing Session Data in Internet Access Networks., in conference of Telecommunications: The Infrastructure for the 21st Century (WTC), 2010, pp.1-6.
2. D. Tsukamoto, and T. Nakashima, Implementation and Evaluation of Distributed Hash Table Using MPI., in International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA), 2010, pp.684-688.
3. L. Hyesook, and J. Yeojin, A parallel multiple hashing architecture for IP address lookup., in Workshop on High Performance Switching and Routing (HPSR), 2004, pp.91-95.
4. Y. Woo-jin, K. Tae-il, and J. Hae-won, Optimizing Hash Table Structure of Flow Exporting Software., in The 8th International Conference on Advanced Communication Technology (ICACT), 2006, pp.892-895.
5. C. Jaeyoung, H. Jinyoung, C. Eunsang et al., Performance comparison of content-oriented networking alternatives: A tree versus a distributed hash table., in IEEE 34th Conference on Local Computer Networks (LCN), 2009, pp.253-256.