Divide and discriminate: Algorithm for deterministic and fast hash lookups

ANCS'09: Symposium on Architecture for Networking and Communications Systems

Volumn , Issue , 2009, Pages 133-142

  Ficara, Domenico ^a   Giordano, Stefano ^a   Kumar, Sailesh ^b   Lynch, Bill ^b  

^a UNIVERSITY OF PISA   (Italy)

^b Huawei Technologies   (United States)

Author keywords

hash tables; lookup; membership query; network processor

Indexed keywords

COMMONLY USED; FULL-LOAD; HASH TABLE; HIGH LOAD; HIGH RATE; LOOK UP TABLE; LOOKUP; LOOKUPS; MEMBERSHIP QUERY; MEMORY STRUCTURE; MULTI CORE; NETWORK APPLICATIONS; NETWORK PROCESSOR; NON-DETERMINISM; NOVEL CONSTRUCTION; ON CHIP MEMORY; PARALLEL COMPUTE; PARALLEL PLATFORMS; PRIMITIVE FUNCTION;

NETWORK ARCHITECTURE;

TABLE LOOKUP;

EID: 78650961362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1882486.1882519     Document Type: Conference Paper

References (35)

1. S. Kumar, J. Turner, P. Crowley and M. Mitzenmacher, "HEXA: Compact Data Structures for Faster Packet Processing," Proc. of IEEE ICNP, Beijing, China, October, 2007.
2. G. H. Gonnet, Expected length of the longest probe sequence in hash code searching, Journal of ACM, 28 (1981), pp. 289-304.
3. M. L. Fredman, J. Komlos, E. Szemeredi, Storing a sparse table with O(1) worst case access time, Journal of ACM, 31, 1984.
4. J. L. Carter, M. N. Wegman, Universal Classes of Hash Functions, JCSS 18, No. 2, 1979, pp. 143-154.
5. P. D. Mackenzie, C. G. Plaxton, R. Rajaraman, On contention resolution protocols and associated probabilistic phenomena, Proc. 26th Annual ACM Symposium on Theory of Computing, 1994.
6. A. Brodnik, I. Munro, Membership in constant time and almost-minimum space, SIAM J. Comput. 28 (1999)
7. M. Dietzfelbinger, et al., Dynamic Perfect Hashing- Upper and Lower Bounds, Proc. 29th IEEE FOCS, 1988.
8. B. Vocking, How Asymmetry Helps Load Balancing. Proc. 40th IEEE Symposium on Foundations of Comp. Science, 1999.
9. M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, Ph.D. thesis, University of California, Berkeley, 1996.
10. Y. Azar, A. Z. Broder , A. R. Karlin , E. Upfal, Balanced allocations, Proc. ACM symposium on Theory of computing, May 23-25, 1994.
11. M. Adler, et al., Parallel randomized load balancing, Proc. 27th ACM Symposium on Theory of Computing, 1995, pp. 238-247.
12. M. Wadvogel, G. Varghese, J. Turner, B. Plattner. Scalable High Speed IP Routing Lookups, Proc. of SIGCOMM 97
13. A. Broder, M. Mitzenmacher, "Using Multiple Hash Functions to Improve IP Lookups", IEEE INFOCOM, 2001, pp. 1454-1463.
14. S. Kumar , J. Turner , J. Williams, Advanced algorithms for fast and scalable deep packet inspection, Proc. ACM/IEEE ANCS, 2006.
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 Symposium on Theory of Computing, 2001.
18. R. Pagh, F. F. Rodler, Cuckoo Hashing, Proc. 9th Annual European Symposium on Algorithms, August 28-31, 2001, pp.121-133.
19. S. Kumar, J. Turner et al., "Peacock hashing: Deterministic and updatable hashing for high performance networking," Proc. IEEE Infocom, 2008, pp. 556-564.
20. L. C. K. Hui, C. Martel, On efficient unsuccessful search, Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992.
21. G. R. Wright, W.R. Stevens, TCP/IP Illustrated, volume 2, Addison-Wesley Publishing Co., 1995.
22. 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.
23. S. Kumar, and P. Crowley, "Segmented Hash: An Efficient Hash Table Implementation for High Performance Networking Subsystems", in proc. Of IEEE/ACM ANCS '05 Princeton, 2005.
24. M. Adiletta, et al. "The Next Generation of Intel IXP Network Processors," Intel Technology Journal, vol. 6, no 3, pp. 6-18, 2002.
25. Hopcroft, John E.; Karp, Richard M. (1973), "An n5/2 algorithm for maximum matchings in bipartite graphs", SIAM Journal on Computing 2 (4): 225-231,
26. Mitchell, Melanie, An Introduction to Genetic Algorithms, 1996, MIT Press, Cambridge, MA.
27. D. Fotakis, et. al, "Space efficient hash tables with worst case constant access time," In STACS, 2003.
28. S. Quinlan and S. Dorward. Venti: a new approach to archival storage. In proc. of the First USENIX Conference on File and Storage Technologies, Monterey,CA, 2002.
29. J. Nieminen and P. Kilpeläinen: Efficient implementation of Aho-Corasick pattern matching automata using Unicode. Software: Practice and Experience, Vol 37, (May 2007)
30. Y. Azar, A. Broder, A. Karlin, E. Upfal. Balanced Allocations, Proc. 26th ACM Symposium on Theory of Computing, 1994.
31. T. Sherwood, G. Varghese, and B. Calder, A pipelined memory architecture for high throughput network processors. SIGARCH Computer Arch. News 31, 2 (May. 2003), 288-2.
32. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier Filter: An efficient data structure for static support lookup tables. In Proc. of SODA '04), pages 30-39. ACM Press, 2004.
33. Z. J. Czech, G. Havas, and B. S. Majewski, "An optimal algorithm for generating minimal perfect hash functions," Information Processing Letters, vol. 43, no. 5, 1992.
34. Y. Lu, B. Prabhakar, and F. Bonomi, "Perfect hashing for network applications," Proc. Symp. on Information Theory, 2006.
35. F. C. Botelho, R. Pagh, and N. Ziviani, "Simple and space-efficient minimal perfect hash functions," Springer-Verlag LNCS, 2007.