IP address lookup using bit-shuffled trie

Pao, Derek; Lu, Ziyan; Poon, Yat Hang

doi:10.1016/j.comcom.2014.04.006

Cited by 15 publications

(6 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The nominal update frequency to the IP routing table is about a few hundred times per second. Some recent hardware implementations of IP address lookup engine [26] and multi-field packet classifier [28] support packet processing rate at 300 plus MPPS. The update to lookup ratio in IP routing table is very low, e.g.…”

Section: Packet Processing Challenges In Ndnmentioning

confidence: 99%

See 1 more Smart Citation

Hardware accelerator to speed up packet processing in NDN router

Pao

2016

Computer Communications

Self Cite

View full text Add to dashboard Cite

Section: Packet Processing Challenges In Ndnmentioning

confidence: 99%

“…Throughput of software-based methods is limited and cannot meet the throughput requirements of core router. Researches on IP address lookup methods gradually shifted to hardware-based approaches in the 20 0 0s [22][23][24][25][26] .…”

mentioning

confidence: 99%

Hardware accelerator to speed up packet processing in NDN router

Pao

2016

Computer Communications

Self Cite

View full text Add to dashboard Cite

“…Furthermore, other MT-based solutions such as Shape Shift Tries (SSTs) [9], CAMP [10], FlashTrie [11], bitshuffled trie (BS-trie) [12], and SHIP [13] have also gained much attention because of their compact search structures and efficient pipelining architectures. Due to lack of space, we do not give the details of these schemes here, and the relevant performance comparisons of specific criteria will be discussed in Sect.…”

Section: Multibit-trie-based Ip Lookupmentioning

confidence: 99%

“…Lulea [6] 16-8-8 -SSTs [9] 7-5-5-5-5-5 15-7-7-7-7-7-7-7 CAMP [10] 12-5-5-5-5 -FlashTrie [11] 15-9-8 BS-trie [12] 7-5-4-4-4-4-4 the prefixes associated with this length, respectively.…”

Section: Algorithm Prefix Partitioning For Ipv4mentioning

confidence: 99%

PR-Trie: A Hybrid Trie with Ant Colony Optimization Based Prefix Partitioning for Memory-Efficient IPv4/IPv6 Route Lookup

Zhang

Qiao

WANG

2023

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

Memory-efficient Internet Protocol (IP) lookup with high speed is essential to achieve link-speed packet forwarding in IP routers. The rapid growth of Internet traffic and the development of optical link technologies have made IP lookup a major performance bottleneck in core routers. In this paper, we propose a new IP route lookup architecture based on hardware called Prefix-Route Trie (PR-Trie), which supports both IPv4 and IPv6 addresses. In PR-Trie, we develop a novel structure called Overlapping Hybrid Trie (OHT) to perform fast longest-prefix-matching (LPM) based on Multibit-Trie (MT), and a hash-based level matching query used to achieve only one off-chip memory access per lookup. In addition, the proposed PR-Trie also supports fast incremental updates. Since the memory complexity in MT-based IP lookup schemes depends on the level-partitioning solution and the data structure used, we develop an optimization algorithm called Bitmap-based Prefix Partitioning Optimization (BP 2 O). The proposed BP 2 O is based on a heuristic search using Ant Colony Optimization (ACO) algorithms to optimize memory efficiency. Experimental results using real-life routing tables prove that our proposal has superior memory efficiency. Theoretical performance analyses show that PR-Trie outperforms the classical Trie-based IP lookup algorithms.

show abstract

“…Through this data structure, the IPv6 routing lookup requires 128 memory accesses in the worst case, and the performance is low. Then some scholars have improved the binary Trie tree, and put forward compression, multi-bit and other improved algorithms [6][7][8][9].…”

Section: Related Algorithms and Researchmentioning

confidence: 99%

A Multi-stage IPv6 Routing Lookup Algorithm Based on Hash Table and Multibit Trie

He¹,

Yang²

2017

dtcse

View full text Add to dashboard Cite

The address length of IPv6 is 128 and it has no classification addressing, which makes routing lookup processing burden of core router is heavier and the requirements are higher. As many existing algorithms cannot adapt to new requirements after expanding to IPv6, it is necessary to propose a new routing lookup algorithm based on IPv6. After thorough analysis of the IPv6 address prefix distribution regularity, this paper proposes a new scheme based on simple data structure: Hash Table and Multibit Trie (retrieval). This algorithm first classifies the prefix value and then starts its first lookup by using the first 48bits prefix of the IPv6 Address. Simulation results show that in most cases, the algorithm needs only one memory access to find the next hop routing information. This algorithm has high lookup speed and can be easily implemented with hardware.

show abstract

IP address lookup using bit-shuffled trie

Cited by 15 publications

References 25 publications

Hardware accelerator to speed up packet processing in NDN router

Hardware accelerator to speed up packet processing in NDN router

PR-Trie: A Hybrid Trie with Ant Colony Optimization Based Prefix Partitioning for Memory-Efficient IPv4/IPv6 Route Lookup

A Multi-stage IPv6 Routing Lookup Algorithm Based on Hash Table and Multibit Trie

Contact Info

Product

Resources

About