Perfect hashing for network applications

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 2774-2778

  Lu, Yi ^a   Prabhakar, Balaji ^a   Bonomi, Flavio ^b  

^a Stanford University   (United States)

^b CISCO SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE MEMORY ACCESSES; BLOOM FILTERS; PERFECT HASHING;

CLASSIFICATION (OF INFORMATION); DATA STRUCTURES; PACKET NETWORKS;

NETWORK ARCHITECTURE;

EID: 34548352604     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261567     Document Type: Conference Paper

References (12)

1. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast hash table lookup using extended bloom filter: An aid to network processing," SIGCOMM, (Philadelphia), Aug, 2005.
2. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communication of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
3. Andrei Broder and Michael Mitzenmacher, "Using multiple hash functions to improve ip lookups," Proceedings of IEEE Infocomd, 2001.
4. A. Kirsch and M. Mitzenmacher, "Simple summaries for hashing with multiple choices," 43rd Annual Allerton Conference on Communication, Control and Computing, Sep, 2005.
5. A. Broder and A. Karlin, "Multilevel adaptive hashing," Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 43-53, 1990.
6. Torben Hagerap and Torsten Tholey, "Efficient minimal perfect hashing in nearly minimal space," STACS 2001, LNCS 2001, pp. 317-326, 2001.
7. M. Fredman and J. Komlós, "On the size of separating systems and families of perfect hash functions," SIAM J. Alg. Disc. Meth, no. 5, pp. 61-68, 1984.
8. K. Mehlhorn, "Data structures and algorithms, vol. 1: Sorting and searching," 1984.
9. Edward A. Fox, Qi Fan Chen, and Lenwood S. Heath, "A faster algorithm for constructing minimal perfect hash functions," 15th Ann Int'l SIGIR Denmark, 1992.
10. M. Fredman, J. Komlós, and E. Szemeredi, "Storing a sparse table with o(1) worst case access time," Journal of the ACM, vol. 31, no. 3, pp. 538-544, July 1984.
11. Martin Dietzfelbinger, Annar Karlin, Kurt Melhom, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan, "Dynamic perfect hashing: Upper and lower bounds," SIAM J. Computing, 1990.
12. D. E. Knuth, "The art of computing programming, volume 3: Sorting and searching," pp. 506-507, 1973.