Flash trie: Beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie

IEEE/ACM Transactions on Networking

Volumn 20, Issue 4, 2012, Pages 1262-1275

  Bando, Masanori ^a   Lin, Yi Li ^b   Chao, H Jonathan ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

^b NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

DRAM; field programmable gate array (FPGA); FlashTrie; hash; IPv4; IPv6; longest prefix match; membership query; next generation network; PC Trie; Prefix Compressed Trie; route lookup

Indexed keywords

FLASHTRIE; HASH; IPV4; IPV6; LONGEST PREFIX MATCHES; MEMBERSHIP QUERY; PC-TRIE; PREFIX COMPRESSED TRIE; ROUTE LOOKUP;

DATA STRUCTURES; DYNAMIC RANDOM ACCESS STORAGE; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); NEXT GENERATION NETWORKS; ROUTERS;

INTERNET PROTOCOLS;

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

References (39)

1. W. Eatherton, G. Varghese, and Z. Dittia, "Tree bitmap: Hardware/software IP lookups with incremental updates," Comput Commun Rev, vol. 34, no. 2, pp. 97-122, 2004.
2. Juniper Networks, "Industry leaders demonstrate 100 Gigabit Ethernet interoperability at OFC," Press Release, 2010 [Online]. Available: http://www.juniper.net
3. Cisco, "Cisco introduces foundation for next-generation Internet: The Cisco CRS-3 carrier routing system," Cisco Press Release, 2010 [Online]. Available: http://newsroom.cisco.com
4. IEEE 802.3 Ethernet Working Group, "IEEE P802.3ba 40 Gb/s and 100 Gb/s Ethernet Task Force," 2010 [Online]. Available: http://www. ieee802.org/3/ba/
5. Cisco, "Approaching the zettabyte era," CiscoWhite Paper, 2008 [Online]. Available: http://www.cisco.com
6. T. Bates, P. Smith, and G. Huston, "CIDR report," [Online]. Available: http://www.cidr-report.org/
7. F. Zane, G. Narlikar, and A. Basu, "CoolCAMs: Power-efficient TCAMs for forwarding engines," in Proc. IEEE INFOCOM, 2003, pp. 42-52.
8. K. Zheng, C. Hu, H. Lu, and B. Liu, "A TCAM-based distributed parallel IP lookup scheme and performance analysis," IEEE/ACM Trans. Netw., vol. 14, no. 4, pp. 863-875, Aug. 2006. (Pubitemid 46405446)
9. P. Gupta, S. Lin, and N. McKeown, "Routing lookups in hardware at memory access speeds," in Proc. IEEE INFOCOM, 1998, pp. 1240-1247.
10. N.-F. Huang and S.-M. Zhao, "A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers," IEEE J. Sel. Areas Commun., vol. 17, no. 6, pp. 1093-1104, Jun. 1999.
11. N.-F. Huang, S.-M. Zhao, J.-Y. Pan, and C.-A. Su, "A fast IP routing lookup scheme for gigabit switching routers," in Proc. IEEE INFOCOM, 1999, vol. 3, pp. 1429-1436.
12. V. Srinivasan and G. Varghese, "Fast address lookups using controlled prefix expansion," Trans. Comput. Syst., vol. 17, no. 1, pp. 1-40, 1999. (Pubitemid 129545750)
13. S. Cadambi, S. Chakradhar, and H. Shibata, "Prefix processing technique for faster IP routing," US Patent 2006/0 200 581 A1, 7 398 278, 2005.
14. S. Kaxiras and G. Keramidas, "IPStash: A set-associative memory approach for efficient IP-lookup," in Proc. IEEE INFOCOM, 2005, vol. 2, pp. 992-1001. (Pubitemid 41390754)
15. J. Hasan, S. Cadambi, V. Jakkula, and S. Chakradhar, "Chisel: A storage-efficient, collision-free hash-based network processing architecture," in Proc. ISCA, 2006, pp. 203-215.
16. 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. (Pubitemid 46323503)
17. S. Dharmapurikar, P.Krishnamurthy, and D. E. Taylor, "Longest prefix matching using bloom filters," IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 397-409, Apr. 2006.
18. H. Song, F. Hao,M. Kodialam, and T. Lakshman, "IPv6 lookups using distributed and load balanced bloom filters for 100 Gbps core router line cards," in Proc. IEEE INFOCOM, 2009, pp. 2518-2526.
19. M. Bando, N. S. Artan, and H. J. Chao, "FlashLook: 100 Gbps hashtuned route lookup architecture," in Proc. HPSR, 2009.
20. M. Hanna, S. Demetriades, S. Cho, and R. Melhem, "Progressive hashing for packet processing using set associative memory," in Proc. ACM/IEEE ANCS, 2009, pp. 153-162.
21. S. Sikka and G. Varghese, "Memory-efficient state lookups with fast updates," in Proc. ACM SIGCOMM, 2000, pp. 335-347.
22. R. Sangireddy, N. Futamura, S. Aluru, and A. K. Somani, "Scalable, memory efficient, high-speed IP lookup algorithms," IEEE/ACM Trans. Netw., vol. 13, no. 4, pp. 802-812, Aug. 2005. (Pubitemid 41269123)
23. H. Song, J. Turner, and J. Lockwood, "Shape shifting tries for faster IP route lookup," in Proc. IEEE ICNP, 2005, pp. 358-367. (Pubitemid 44733872)
24. A. Basu and G. Narlikar, "Fast incremental updates for pipelined forwarding engines," IEEE/ACM Trans. Netw., vol. 13, no. 3, pp. 690-703, Jun. 2005. (Pubitemid 41100615)
25. W. Jiang and V. K. Prasanna, "Multi-terabit IP lookup using parallel bidirectional pipelines," in Proc. CF, 2008, pp. 241-250.
26. H. Le and V. Prasanna, "Scalable high throughput and power efficient IP-lookup on FPGA," in Proc. IEEE FCCM, 2009, pp. 167-174.
27. S. Kumar, M. Becchi, P. Crowley, and J. Turner, "CAMP: Fast and efficient IP lookup architecture," in Proc. ACM/IEEE ANCS, 2006, pp. 51-60. (Pubitemid 47209673)
28. Samsung, "Samsung DRAM," [Online]. Available: http://www.samsung.com/
29. Micron, "Micron DRAM," [Online]. Available: http://www.micron.com/
30. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commun. ACM, vol. 13, no. 7, pp. 422-426, 1970.
31. S. Kumar and P. Crowley, "Segmented hash: An efficient hash table implementation for high performance networking subsystems," in Proc. ACM ANCS, 2005, pp. 91-103.
32. A. Kirsch and M. Mitzenmacher, "The power of one move: Hashing schemes for hardware," in Proc. IEEE INFOCOM, 2008, pp. 106-110.
33. N. Artan, H. Yuan, and H. Chao, "A dynamic load-balanced hashing scheme for networking applications," in Proc. IEEE GLOBECOM, 2008, pp. 1-6.
34. M. Mitzenmacher, "The power of two choices in randomized load balancing," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 10, pp. 1094-1104, Oct. 2001.
35. F. Hao, M. Kodialam, and T. V. Lakshman, "Building high accuracy bloom filters using partitioned hashing," in Proc. ACM SIGMETRICS, 2007, pp. 277-288. (Pubitemid 350158091)
36. University of Oregon, "University of Oregon Route Views Project," 2005 [Online]. Available: http://www.routeviews.org
37. M. Wang, S. Deering, T. Hain, and L. Dunn, "Non-random generator for IPv6 tables," in Proc. IEEE HOTI, 2004, pp. 35-40. (Pubitemid 40338873)
38. D. Klein, "Memory technology trends and challenges," 2005 [Online]. Available: http://www.jedex.org/images/pdf/d-klein-keynote.pdf
39. R. Advani, "Server memory solutions for the impending data center power crisis," 2008 [Online]. Available: http://download.micron.com/pdf/ whitepapers/server-memory-white-paper-hi.pdf