FlashTrie: Hash-based prefix-compressed trie for ip route lookup beyond 100Gbps

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Bando, Masanori ^a   Chao, H Jonathan ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTERNAL MEMORY; FPGA CHIPS; HIGH-END ROUTERS; HIGH-SPEED; LARGE DATA; LOOKUPS; MEMBERSHIP QUERY; MEMORY LOAD; MEMORY MODULES; MEMORY UTILIZATION; MULTI-BITS; OFF-CHIP MEMORIES; REAL-TIME UPDATES; ROUTE LOOKUP; ROUTING TABLE; TREE BITMAP; WORST-CASE THROUGHPUT;

DATA STRUCTURES; DYNAMIC RANDOM ACCESS STORAGE; INTERNET PROTOCOLS;

ROUTERS;

EID: 77953315191     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5462142     Document Type: Conference Paper

References (23)

1. W. Eatherton, G. Varghese, and Z. Dittia, "Tree Bitmap: Hardware/ Software IP Lookups with Incremental Updates," ACM SIGCOMM Computer Communication Review, vol. 34, no. 2, pp. 97-122, 2004.
2. CIDR Report. [Online]. Available: http://www.cidr-report.org/
3. F. Zane, G. Narlikar, and A. Basu, "CoolCAMs: Power-Efficient TCAMs for Forwarding Engines," in Proc. of INFOCOM, vol. 1, 2003, pp. 42-52.
4. K. Zheng, C. Hu, H. Lu, and B. Liu, "A TCAM-Based Distributed Parallel IP Lookup Scheme and Performance Analysis," IEEE/ACM Transactions on Networking, vol. 14, no. 4, pp. 863-875, 2006.
5. S. Cadambi, S. Chakradhar, and H. Shibata, "Prefix Processing Technique for Faster IP Routing," US Patent 2006/0 200 581 A1, 7 398 278, May., 2005, issue date Jul 8, 2008.
6. S. Kaxiras and G. Keramidas, "IPStash: A Set-associative Memory Approach for Efficient IP-Lookup," in Proc. of INFOCOM, vol. 2, 2005, pp. 992-1001.
7. J. Hasan, S. Cadambi, V. Jakkula, and S. Chakradhar, "Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture," in Proc. of ISCA, 2006, pp. 203-215.
8. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, "Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing," in Proc. of SIGCOMM, 2005, pp. 181-192.
9. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, "Longest Prefix Matching Using Bloom Filters," IEEE/ACM Transactions on Networking, vol. 14, no. 2, pp. 397-409, 2006.
10. H. Song, F. Hao, M. Kodialam, and T. Lakshman, "IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards," in Proc. of INFOCOM, 2009, pp. 2518-2526.
11. M. Bando, N. S. Artan, and H. J. Chao, "FlashLook: 100Gbps Hash- Tuned Route Lookup Architecture," in Proc. of HPSR, 2009.
12. R. Sangireddy, N. Futamura, S. Aluru, and A. K. Somani, "Scalable, Memory Efficient, High-Speed IP Lookup Algorithms," IEEE/ACM Transactions on Networking, vol. 13, no. 4, pp. 802-812, 2005.
13. H. Song, J. Turner, and J. Lockwood, "Shape Shifting Tries for Faster IP Route Lookup," in Proc. of ICNP, 2005.
14. A. Basu and G. Narlikar, "Fast Incremental Updates for Pipelined Forwarding Engines," IEEE/ACM Transactions on Networking, vol. 13, no. 3, pp. 690-703, 2005.
15. W. Jiang and V. K. Prasanna, "Multi-Terabit IP Lookup Using Parallel Bidirectional Pipelines," in Proc. of CF, 2008, pp. 241-250.
16. B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, vol. 13, no. 7, 1970.
17. University of Oregon Route Views Project. [Online]. Available: http://www.routeviews.com/
18. M. Wang, S. Deering, T. Hain, and L. Dunn, "Non-Random Generator for IPv6 Tables," in Proc. of the IEEE Symposium on High Performance Interconnects,, 2004, pp. 35-40.
19. D. Klein. Memory Technology Trends and Challenges. [Online]. Available: http://www.jedex.org/images/pdf/d-klein-keynote.pdf
20. R. Advani. Server Memory Solutions for the Impending Data Center Power Crisis. [Online]. Available: http://download.micron.com/pdf/whitepapers/ servermemory-white-paper-hi.pdf
21. Samsung DRAM. [Online]. Available: http://www.samsung.com/
22. Micron DRAM. [Online]. Available: http://www.micron.com/
23. PLDA XpressFX. [Online]. Available: http://www.plda.com/