Wire Speed IPv6 Forwarding on Multi-core Platforms

With the exhaustion of IPv4 (32 bit) address space, IPv6 (128 bit) addressing is emerging to facilitate the immense growth of the Internet. However, this poses two main challenges to high-speed routers that perform packet forwarding: 1) increased IP lookup complexity and 2) increased routing table storage requirements. In this work, we present a high-performance IPv6 lookup engine based on routing table partitioning using an algorithm we devised, and range-tree search, for backbone networks. The disjoint partitioning improves the parallelism of the IP lookup process, which enables one to take advantage of software and hardware platforms with parallel processing capabilities. We use two state-of-the-art multi-core platforms and show that the proposed solution is able to operate at 150+ Gbps throughput rates for a 2 million entry routing table. Further, we show that the solution is scalable even up to 8 million entry routing tables while sustaining 40+ Gbps rates.

[1]  Viktor K. Prasanna,et al.  Scalable Tree-Based Architectures for IPv4/v6 Lookup Using Prefix Partitioning , 2012, IEEE Transactions on Computers.

[2]  Viktor K. Prasanna,et al.  FRuG: A benchmark for packet forwarding in future networks , 2010, International Performance Computing and Communications Conference.

[3]  Toshiaki Miyazaki,et al.  High-speed table lookup engine for IPv6 longest prefix match , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[4]  Pingfeng Zhong An IPv6 address lookup algorithm based on recursive balanced multi-way range trees with efficient search and update , 2011, 2011 International Conference on Computer Science and Service System (CSSS).

[5]  Xinan Tang,et al.  TrieC: A High-Speed IPv6 Lookup with Fast Updates Using Network Processor , 2005, ICESS.

[6]  H. Jonathan Chao,et al.  FlashTrie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie , 2012, IEEE/ACM Transactions on Networking.