A Fast Connection Construction and Update Algorithm

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 712-715)

Pages:

2506-2509

Citation:

Online since:

June 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[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.

Google Scholar

[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.

DOI: 10.1109/bwcca.2010.155

Google Scholar

[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.

DOI: 10.1109/hpsr.2004.1303436

Google Scholar

[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.

DOI: 10.1109/icact.2006.206106

Google Scholar

[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.

DOI: 10.1109/lcn.2009.5355081

Google Scholar

[6] Y. Bu, H. Guo, H. Hu et al., "A Traffic Splitting Algorithm Based on Dual Hash Table for Multi-path Internet Routing." in International Conference on Machine Vision and Human-Machine Interface (MVHI), 2010, pp.397-400.

DOI: 10.1109/mvhi.2010.20

Google Scholar

[7] L. L. Peterson and B. S. Davie, Computer Network: A Systems Approach. San Francisco: Morgan Kaufmann, 2003, pp.444-446

Google Scholar