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.