Hash Technology for Connection Management in High-Speed Networks

Rong Ji Liu; Yun Zhao Li; Chun Xia Cao

doi:10.4028/www.scientific.net/AMR.998-999.1151

Paper Titles

Detection and Control of I/O Interface by Calling DLL in VB
p.1129

Distribution Center Multi-Objective Location Problem Using NSGA-II
p.1133

Domain Adaptation for Video Steganalysis against Motion Vector Based Steganography
p.1138

Empirical Analysis on Human Dynamics of QQ Group Communication
p.1146

Hash Technology for Connection Management in High-Speed Networks
p.1151

Network Case Establishment and Application Research under Portable Network Environment
p.1157

Network Coding Based Multiple-Hop Efficient Transmission Method for Multiple-User Multiple-Relay Networks
p.1161

Privacy Preserving for Location-Based Services in Road Networks
p.1165

QoS Routing Optimization Based on Improved Genetic Algorithm
p.1169

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 998-999Hash Technology for Connection Management in...

Hash Technology for Connection Management in High-Speed Networks

Abstract:

Connection management uses hash table. Hash function and data structure are both the bottleneck technology. For balancing computation cost and uniformity of hash function, three new hash functions were devised——the Random number Mapping Xor (RMX) function based on random number table mapping, the Segment Sampling Xor (SSX) function and Byte by Byte Shift Xor (BBSX) function based on segment generation and bit operations. The results show that these three functions are all better than IPSX on uniformity. This paper analyzed memory access performance and miss rate of multiple slots hash table, and presented the technical idea for shorting packet process time in connection management. Simulation is described.

You might also be interested in these eBooks

Advances in Applied Sciences, Engineering and Technology II

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 998-999)

Pages:

1151-1156

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.998-999.1151

Citation:

Cite this paper

Online since:

July 2014

Authors:

Rong Ji Liu*, Yun Zhao Li, Chun Xia Cao

Keywords:

Bit Operation, Connection Management, Hash Function, Hash Table, Multiple Slots, Separate Chaining

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] CNNIC. The 31th Chinese Internet Development Statistical Report[M]. (2013).

Google Scholar

[2] M ROESCH. Snort: Lightweight Intrusion Detection for Networks[C]. In: Proceedings of the 13th USENIX Conference on System Administration, 1999: 229-238.

Google Scholar

[3] V PAXSON. Bro: A System for Detecting Network Intruders in Real Time[J]. Computer Networks, 1999, 31(23): 2435-2463.

DOI: 10.1016/s1389-1286(99)00112-7

Google Scholar

[4] XIONG Bing. Research on Some Key Problems of High-speed Network Traffic Analysis[D]. Wuhan: Huazhong University of Science and Technology, 2009. (In Chinese).

Google Scholar

[5] ZSEBY T, MOLINA M, RASPALL F, et al. Sampling and Filtering Techniques for IP Packet Selection [EB/OL]. http: /tools. ietf. org/html/draft-ietf-psamp-sample-tech-05#section-17.

DOI: 10.17487/rfc5475

Google Scholar

[6] ZHAO Guo-feng, YAN Liang. Keywords Decompound Hash Algorithm for Quick Flow Classification[J]. Computer Engineering, 2010, 36(16): 79-81. (In Chinese).

Google Scholar

[7] HDL Design House. HCR MDS: MD5 crypto core family[M]. December (2002).

Google Scholar