Segmented hash: An efficient hash table implementation for high performance networking subsystems

2005 Symposium on Architectures for Networking and Communications Systems, ANCS 2005

Volumn , Issue , 2005, Pages 91-103

  Kumar, Sailesh ^a   Crowley, Patrick ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Hash table; Lookup

Indexed keywords

ANALYTICAL MODELING; CONSTANT TIME; DEVICE TECHNOLOGIES; EFFICIENT IMPLEMENTATION; FALSE POSITIVE RATES; HASH OPERATIONS; HASH TABLE; HIGH LOAD; HIGH PROBABILITY; HIGH-PERFORMANCE NETWORKING; LOOKUP; LOW LOAD; MEMORY OPERATIONS; MEMORY UTILIZATION; NOVEL ALGORITHM; OFF-CHIP MEMORIES; ON CHIPS; ORDERS OF MAGNITUDE; PERFORMANCE BENEFITS; PROBE SEQUENCE; SEARCH COSTS; SELECTIVE FILTERS; SOFTWARE SIMULATION; STORAGE LOCATION;

ALGORITHMS;

TABLE LOOKUP;

EID: 36949037456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2005.4675269     Document Type: Conference Paper

References (32)

1. Y. Azar, A. Broder, A. Karlin, E. Upfal. Balanced Allocations, Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 593-602.
2. M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, Ph.D. thesis, University of California, Berkeley, 1996.
3. Y. Azar, A. Z. Broder , A. R. Karlin , E. Upfal, Balanced allocations (extended abstract), Proc. ACM symposium on Theory of computing, May 23-25, 1994, pp. 593-602.
4. M. Adler, S. Chakrabarti, M. Mitzenmacher, L. Rasmussen, Parallel randomized load balancing, Proc. 27th Annual ACM Symposium on Theory of Computing, 1995, pp. 238-247.
5. G. H. Gonnet, Expected length of the longest probe sequence in hash code searching, Journal of ACM, 28 (1981), pp. 289-304.
6. M. L. Fredman, et al., Storing a sparse table with O(1) worst case access time, Journal of ACM, 31 (1984), pp. 538-544.
7. J. L. Carter, M. N. Wegman, Universal Classes of Hash Functions, JCSS 18, No. 2, 1979, pp. 143-154. (Pubitemid 9461408)
8. P. D. Mackenzie, C. G. Plaxton, R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 153-162.
9. A. Brodnik, I. Munro, Membership in constant time and almost-minimum space, SIAM J. Comput. 28 (1999) 1627- 1640. (Pubitemid 129304145)
10. H. Song, S. Dharmapurikar, J. Turner, J. Lockwood, "Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing," SIGCOMM, Philadelphia PA, August 20-26, 2005.
11. B. Vocking, How Asymmetry Helps Load Balancing. Proc. 40th IEEE Symp. on Foundations of Comp. Science, 1999, pp. 131-141. (Pubitemid 30539986)
12. M. Wadvogel, G. Varghese, J. Turner, B. Plattner. Scalable High Speed IP Routing Lookups, Proc. of SIGCOMM 97, 1997.
13. A. Broder, M. Mitzenmacher, "Using Multiple Hash Functions to Improve IP Lookups", IEEE INFOCOM, 2001, pp. 1454-1463. (Pubitemid 32485792)
14. W. Cunto, P. V. Poblete: Two Hybrid Methods for Collision Resolution in Open Addressing Hashing, SWAT 1988, pp. 113-119.
15. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, The MIT Press, 1990.
16. P. Larson, Dynamic Hash Tables, CACM, 1988, 31 (4).
17. M. Naor, V. Teague. Anti-persistence: History Independent Data Structures. Proc. 33nd Symp. on Theory of Computing, May 2001.
18. R. Pagh, F. F. Rodler, Cuckoo Hashing, Proc. 9th Annual European Symposium on Algorithms, August 28-31, 2001, pp.121-133. (Pubitemid 33328952)
19. D. E. Knuth, The Art of Computer Programming, volume 3, Addison-Wesley Publishing Co, second edition, 1998.
20. L. C. K. Hui, C. Martel, On efficient unsuccessful search, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 217-227.
21. Goto, Ida, and Gunji, "Parallel hashing algorithms", Information Processing Letters, Vol. 6, No. 1, Feb. 1977.
22. Hiraki, Nishida, and Shimada, "Evaluation of associative memory using parallel chained hashing", IEEE Tran. On Software Engineering, Vol. 33, No. 9, pp. 851-855, Sept. 1984.
23. A. Broder and A. Karlin, "Multilevel adaptive hashing," ACM-SIAM Symposium on Discrete Algorithm, 1990.
24. G. R. Wright, W.R. Stevens, TCP/IP Illustrated, volume 2, Addison-Wesley Publishing Co., 1995.
25. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors", Comm. of the ACM, v.13 n.7, p.422-426, July 1970
26. Li Fan , et al., "Summary cache: a scalable wide-area web cache sharing protocol", IEEE/ACM Transactions on Networking (TON), v.8 n.3, p.281-293, June 2000. (Pubitemid 30893632)
27. Vern Paxson, "Bro: A system for detecting network intruders in real time", Computer Networks, December 1999.
28. David V. Schuehler, James Moscola, and John W. Lockwood, "Architecture for a hardware-based TCP/IP content scanning system", In IEEE Hot Interconnects, Stanford, CA, August 2003.
29. George S. Lueker, Mariko Molodowitch, "More analysis of double hashing," Combinatorica 13(1): 83-96 (1993).
30. Cu-11 standard cell/gate array ASIC, IBM.
31. Virtex-4 FPGA, Xilinx.
32. Dharmapurikar, et al., "Longest Prefix matching using bloom filters." In Proc. of SIGCOMM, Karlsruhe, Germanny. Aug, 2003.