K Huang, G Xie, R Li, S Xiong - Journal of Network and Computer …, 2013 - Elsevier
Hash tables are widely used in network applications, as they can achieve O (1) query, insert, and delete operations at moderate loads. However, at high loads, collisions are prevalent in …
D Pao, X Wang, Z Lu - 2013 15th International Conference on …, 2013 - ieeexplore.ieee.org
There has been a general opinion that it is difficult to construct perfect hash tables with high load factor for large datasets having a million records. The problem is even more …
T Song, Y Yang, P Crowley - 2017 ACM/IEEE Symposium on …, 2017 - ieeexplore.ieee.org
Hash table is one of the most fundamental and critical data structures for membership query and maintenance. However, the performance of a standard hash table degrades greatly …
D Li, P Chen - 2013 16th International Conference on Network …, 2013 - ieeexplore.ieee.org
As an efficient data structure for membership testing, the Bloom filter has found wide applications in modern day data networks, including high-speed packet routing for IPbased …
T Zink, M Waldvogel - SpringerPlus, 2015 - Springer
Hashing has yet to be widely accepted as a component of hard real-time systems and hardware implementations, due to still existing prejudices concerning the unpredictability of …
S Zhao, J Li, D Li - NOMS 2018-2018 IEEE/IFIP Network …, 2018 - ieeexplore.ieee.org
Packet classification is one of the core functions in present-day networking applications. Various classification algorithms have been developed, including tuple space search (TSS) …
J Zhou, C Wang, X Li, X Zhou - International Journal of …, 2015 - inderscienceonline.com
Naive hash table (NHT) scheme associates a set of keys to a set of values. Apart from hash address computation, the search operation of the traditional scheme still brings three parts of …