The power of one move: Hashing schemes for hardware

IEEE/ACM Transactions on Networking

Volumn 18, Issue 6, 2010, Pages 1752-1765

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Content addressable memory (CAM); hash tables; high speed packet processing

Indexed keywords

FLUID LIMITS; HARDWARE IMPLEMENTATIONS; HASH TABLE; HIGH-SPEED PACKET PROCESSING; SPACE UTILIZATION;

ASSOCIATIVE STORAGE; ELECTRICAL ENGINEERING; SOFTWARE ENGINEERING;

HARDWARE;

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

References (35)

1. M. Adiletta, M. Rosenbluth, D. Bernstein, G. Wolrich, and H. Wilkinson, "The next generation of Intel IXP network processors, " Intel Technol. J., vol. 6, no. 3, pp. 6-18, 2002.
2. Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced allocations, " SIAM J. Comput., vol. 29, no. 1, pp. 180-200, 1999.
3. F. Baboescu and G. Varghese, "Scalable packet classification, " IEEE/ACM Trans. Netw., vol. 13, no. 1, pp. 2-14, Feb. 2005.
4. A. Broder and A. Karlin, "Multilevel adaptive hashing, " in Proc. 1st ACM-SIAM SODA, 1990, pp. 43-53.
5. A. Broder and M. Mitzenmacher, "Using multiple hash functions to improve IP lookups, " in Proc. IEEE INFOCOM, 2001, pp. 1454-1463.
6. J. Byers, J. Considine, and M. Mitzenmacher, "Geometric generalizations of the power of two choices, " in Proc. 16th ACM SPAA, 2004, pp. 54-63.
7. Cisco NetFlow, Accessed Feb. 28, 2008 [Online]. Available: http://www.cisco.com/go/netflow
8. M. Dietzfelbinger and C. Weidling, "Balanced allocation and dictionaries with tightly packed constant size bins, " Theoret. Comput. Sci., vol. 380, no. 1-2, pp. 47-68, 2007.
9. C. Estan, K. Keys, D. Moore, and G. Varghese, "Building a better Net-Flow, " in Proc. ACM SIGCOMM, 2004, pp. 245-256.
10. A. Feldmann and S. Muthukrishnan, "Tradeoffs for packet classification, " in Proc. IEEE INFOCOM, 2000, pp. 1193-1202.
11. D. Fotakis, R. Pagh, P. Sanders, and P. Spirakis, "Space efficient hash tables withworst case constant access time, " Theory Comput. Syst., vol. 38, no. 2, pp. 229-248, 2005.
12. G. Grimmett and D. Stirzaker, Probability and Random Processes, 3rd ed. Oxford, U.K.: Oxford Univ. Press, 2003.
13. A. Kirsch and M. Mitzenmacher, "The power of one move: Hashing schemes for hardware, " in Proc. IEEE INFOCOM, 2008, pp. 106-110.
14. A. Kirsch and M. Mitzenmacher, "Simple summaries for hashing with choices, " IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 218-231, Feb. 2008.
15. A. Kirsch and M. Mitzenmacher, "Using a queue to de-amortize cuckoo hashing in hardware, " in Proc. 45th Annu. Allerton Conf. Commun., Control, Comput., 2007.
16. T. G. Kurtz, "Solutions of ordinary differential equations as limits of pure jump Markov processes, " J. Appl. Probab., vol. 7, pp. 49-58, 1970.
17. T. G. Kurtz, Approximation of Population Processes. Philadelphia, PA: SIAM, 1981.
18. T. V. Lakshman and D. Stiliadis, "High-speed policy-based packet forwarding using efficient multi-dimensional range matching, " in Proc. ACM SIGCOMM, 1998, pp. 203-214.
19. J. Lunteren and T. Engbersen, "Fast and scalable packet classification, " IEEE J. Sel. Areas Commun., vol. 21, no. 4, pp. 560-571, May 2003.
20. M. Mitzenmacher, "The power of two choices in randomized load balancing, " Ph.D. thesis, University of California, Berkeley, 1996.
21. M. Mitzenmacher, A. Richa, and R. Sitaraman, The Power of Two Choices: A Survey of Techniques and Results, P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, Eds. Norwell, MA: Kluwer, 2001, pp. 255-312.
22. M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2005.
23. M. Mitzenmacher and B. Vöcking, "The asymptotics of selecting the shortest of two, improved, " in Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich, Y. Suhov, Ed. Providence, RI: American Mathematical Society, 2003, pp. 165-176.
24. R. Pagh and F. Rodler, "Cuckoo hashing, " J. Algor., vol. 51, no. 2, pp. 122-144, 2004.
25. V. Paxson, "Bro:Asystem for detecting network intruders in real time, " Comput. Netw., vol. 31, no. 23-24, pp. 2435-2463, 1999.
26. A. Shwartz and A.Weiss, Large Deviations for Performance Analysis: Queues, Communications, and Computing. London, U.K.: Chapman & Hall, 1995.
27. 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.
28. Snort, Accessed Feb. 28, 2008 [Online]. Available: http://www. snort.org
29. V. Srinivasan and G. Varghese, "Fast address lookups using controlled prefix expansion, " ACM Trans. Comput. Syst., vol. 17, no. 1, pp. 1-40, 1999.
30. G. Varghese, Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. San Mateo, CA: Morgan Kaufmann, 2004.
31. B. Vöcking, "How asymmetry helps load balancing, " J. ACM, vol. 50, no. 4, pp. 568-589, 2003.
32. N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich, "Queueing system with selection of the shortest of two queues: An asymptotic approach, " Problems Inf. Transmission, vol. 32, no. 1, pp. 15-27, 1996.
33. N. D. Vvedenskaya and Y. M. Suhov, "Dobrushin's mean-field approximation for a queue with dynamic routing, " INRIA Research Rep. 3328, 1997.
34. N. D. Vvedenskaya and Y. M. Suhov, "Functional equations in asymptotical problems of queuing theory, " J. Math. Sci., vol. 120, no. 3, pp. 1255-1276, 2004.
35. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups, " ACM SIGCOMM Comput. Commun. Rev., vol. 27, no. 4, pp. 25-36, 1997.