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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
