Simple summaries for hashing with choices

IEEE/ACM Transactions on Networking

Volumn 16, Issue 1, 2008, Pages 218-231

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Hash tables; Router architecture; Table lookup

Indexed keywords

COMPUTER ARCHITECTURE; ROUTERS;

HASH TABLES; ROUTER ARCHITECTURE;

TABLE LOOKUP;

EID: 40749085213     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.899058     Document Type: Article

References (20)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced allocations," SIAM J. Comput., vol. 29, no. 1, pp. 180-200, 1999.
2. B. Bloom, "Space/time tradeoffs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, 1970.
3. A. Broder and A. Karlin, "Multilevel adaptive hashing," in Proc. 1st ACM-SIAM Symp. Discrete Algorithms (SODA), 1990, pp. 43-53.
4. A. Broder and M. Mitzenmacher, "Using multiple hash functions to improve IP Lookups," in Proc. IEEE INFOCOM, 2001, pp. 1454-1463.
5. A. Broder and M. Mitzenmacher, "Network applications of Bloom filters: A survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, 2004.
6. J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalization of the power of two choices," in Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA), 2004, pp. 54-63.
7. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal, "The Bloomier filter: an efficient data structure for static support lookup tables," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), 2004, pp. 30-39.
8. E. D. Demaine, T. Jones, and M. Pǎtraşcu, "Interpolation search for non-independent data," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), 2004, pp. 522-523.
9. P. C. Dillinger and P. Manolios, "Fast and accurate bitstate verification for SPIN," in Proc. 11th Int. SPIN Workshop on Model Checking of Software (SPIN), 2004, pp. 57-75.
10. L. Fan, P. Cao, J. Almeida, and A. Z. Broder, "Summary cache: A scalable wide-area Web cache sharing protocol," IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, Jun. 2000.
11. G. H. Gonnet and R. B. Yates, Handbook of Algorithms and Data Structures In Pascal and C, 2nd ed. Reading, MA: Addison-Wesley, 1991.
12. A. Kirsch and M. Mitzenmacher, "Less hashing, same performance: Building a better Bloom filter," in Proc. 14th Annu. Eur. Symp. Algorithms (ESA), 2006, pp. 456-467.
13. A. Kirsch and M. Mitzenmacher, "Simple summaries for hashing with multiple choices," in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, 2005.
14. M. Mitzenmacher, "The power of two choices in randomized load balancing," Ph.D. dissertation, Univ. California, Berkeley, 1996.
15. M. Mitzenmacher, "How useful is old information?," IEEE Trans. Parallel Distrib. Syst., vol. 11, no. 1, pp. 6-20, 2000.
16. M. Mitzenmacher, "Compressed Bloom Filters," IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 613-620, May 2002.
17. M. Mitzenmacher, A. Richa, and R. Sitaraman,, P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, Eds., The Power of Two Choices: A Survey of Techniques and Results. Norwell, MA: Kluwer, 2001, pp. 255-312.
18. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.
19. A. Pagh, R. Pagh, and S. Srinivas Rao, "An Optimal Bloom Filter Replacement," in Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005, pp. 823-829.
20. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast hash table lookup using extended Bloom filter: An aid to network processing," in Proc. ACM SIGCOMM, 2005, pp. 181-192.