Value-coded trie structure for high-performance IPv6 lookup

Computer Journal

Volumn 58, Issue 2, 2013, Pages 204-214

  Erdem, Oʇuzhan ^a   Carus, Aydin ^a   Le, Hoang ^b  

^a TRAKYA UNIVERSITY   (Turkey)

^b University of Southern California ^*  (United States)

Author keywords

IP lookup; longest prefix match; packet forwarding; pipeline; trie

Indexed keywords

DATA STRUCTURES; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); MEMORY ARCHITECTURE; PIPELINES; STATIC RANDOM ACCESS STORAGE; TREES (MATHEMATICS);

INTERNET PROTOCOL LOOKUPS; IP LOOKUP; LONGEST PREFIX MATCHES; PACKET FORWARDING; PIPELINED ARCHITECTURE; STATIC RANDOM ACCESS MEMORY; TREE-BASED ALGORITHMS; TRIE;

INTERNET PROTOCOLS;

EID: 84922445340     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxt153     Document Type: Article

References (21)

1. Gringeri, S. Basch, E.B. and Xia, T.J. (2012) Technical considerations for supporting data rates beyond 100 Gb/s. IEEE Commun. Mag., 56, 21-30.
2. Liu, Y. Amin, S.O. and Wang, L. (2013) Efficient FIB caching using minimal non-overlapping prefixes. SIGCOMM Comput. Commun. Rev., 43, 14-21.
3. 'IPv4 Exhaustion'. http://www.ripe.net/internet-coordination/ipv4-exhaustion (accessed July 8, 2013).
4. Hinden, R. and Deering, S. (2003) Internet Protocol Version 6 (IPv6) Addressing Architecture, RFC3513. RFC Editor, USA.
5. Ruiz-Sanchez, M.A., Biersack, E.W. and Dabbous, W. (2001) Survey and taxonomy of IP address lookup algorithms. IEEE Netw., 15, 8-23.
6. Waldvogel, M. Varghese, G., Turner, J. and Plattner, B. (1997) Scalable High Speed IP Routing Lookups. Proc. SIGCOMM 97, Cannes, French Riviera, France, September 16-18, pp. 25-38. ACM, NewYork.
7. Dharmapurikar, S., Krishnamurthy, P. and Taylor, D.E. (2006) Longest prefix matching using bloom fiters. IEEE/ACM Trans. Netw., 14, 397-409.
8. Bando, M. Lin, Y. and Chao, J. (2012) FlashTrie: beyond 100-Gb/s IP route lookup using hash-based prefix-compressed trie. IEEE/ACM Trans. Netw., 20, 1262-1275.
9. Eatherton, W., Varghese, G. and Dittia, Z. (2004) Tree bitmap: hardware software IP lookups with incremental updates. SIGCOMM Comput. Commun. Rev., 34, 97-122.
10. Baboescu, F., Tullsen, D.M., Rosu, G. and Singh, S. (2005) A Tree Based Router Search Engine Architecture with Single Port Memories. Proc. ISCA 05, Madison, WI, USA, June 4-8, pp. 123-133. IEEE Computer Society, Washington.
11. Jiang, W. and Prasanna, V.K. (2007)A Memory-Balanced Linear Pipeline Architecture for Trie-Based IP Lookup. Proc. HOTI 07, Stanford, CA, USA, August 22-24, pp. 83-90. IEEE Computer Society, Washington.
12. Morrison, D.R. (1968) Patriciapractical algorithm to retrieve information coded in alphanumeric. J. ACM, 15, 514-534.
13. Le, H., Jiang, W. and Prasanna, V.K. (2011) Memory-Efficient Ipv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression. Proc. FCCM 11, Salt Lake City, UT, USA, May 1-3, pp. 242-249. IEEE Computer Society, Washington.
14. Erdem, O., Carus, A. and Le, H. (2012) Compact Trie Forest: Scalable Architecture for IP Lookup on FPGAs. Proc. ReConFig 12, Cancun, Mexico, December 4-7, pp. 1-6. IEEE Computer Society, Washington.
15. Le, H. and Prasanna, V.K. (2012) Scalable tree-based architectures for IPv4/v6 lookup using prefix partitioning. IEEE Trans. Comput., 61, 1026-1039.
16. Fadishei, H., Zamani, M.S. and Sabaei, M. (2005) A Novel Reconfigurable Hardware Architecture for IP Address Lookup. Proc. ANCS 05, Princeton, NJ, USA, October 26-28, pp. 81-90. ACM, NewYork.
17. Le, H. and Prasanna, V.K. (2009) Scalable High Throughput and Power Efficient IP Lookup on FPGA. Proc. FCCM 09, Napa, CA, USA, April 5-7, pp. 167-174. IEEE Computer Society, Washington.
18. Srinivasan, S. andVarghese, G. (1999) Fast address lookups using controlled prefix expansion. IEEE Trans. Comput., 17, 1-40.
19. RIS Raw Data, http://data.ris.ripe.net (accessed March 6, 2010).
20. Basu, A. and Narlikar, G. (2005) Fast Incremental Updates for Pipelined Forwarding Engines. IEEE/ACM Trans. Netw., 13, 690-703.
21. Wang, M., Deering, S., Hain, T. and Dunn, L. (2004) Non-Random Generator for Ipv6 Tables. Proc. HOTI 04, Stanford, CA, USA, August 25-27, pp. 35-40. IEEE Computer Society, Washington.