Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Symposium on Information Engineering and Electronic Commerce, 3rd (IEEC 2011)
Editor
C. B. Povloviq
C. B. Povloviq
National Technical University of Ukraine
Search for other works by this author on:
C. W. Lu
C. W. Lu
Huangshi Institute of Technology
Search for other works by this author on:
ISBN:
9780791859759
No. of Pages:
562
Publisher:
ASME Press
Publication date:
2011

This paper proposes an efficient hash table, named PRHMTF (Pseudo Random Hashing-Move to Front), to maintain a large number of simultaneous TCP connections in highspeed networks. Firstly, we design a hash function PRH by defining connection identifier as its input keyword and selecting suitable operators to compute the keyword. To resolve hash collision efficiently, we apply MTF heuristic to improve the traditional chaining resolution in virtue of network traffic locality. Finally, we evaluate the PRH-MTF connection table by experiments with high-speed network traffic trace. Experimental results indicate that the PRH-MTF connection table performs lookup operations better than the traditional simple XOR sorted one.

Abstract
Keywords
Introduction
Related Literature
Hash Function
Hash Collision Resolution
Experiments
Conclusions
Acknowledgments
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal