Scalable pipelined IP lookup with prefix tries

Wu, Yi; Nong, Ge; Hamdi, Mounir

doi:10.1016/j.comnet.2017.03.017

Cited by 5 publications

(7 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To achieve high speed lookups, the maximal number of memory accesses per one lookup should be only one. The pipeline technique with multiple memory instances needs to be used to virtually achieve this goal [4], [7], [13]- [14], [18]. There are still multiple accesses per one lookup.…”

Section: Related Workmentioning

confidence: 99%

“…However, in these solutions, the first few stages have lower number of stored nodes. In [13], the imbalance problem of the early pipeline stages is avoided by using the randomization principle and circular pipeline. The circular pipeline enables to start searching at any pipeline stage and the randomization principle enables even distribution of nodes across all stages.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Cica

2021

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

One of the most critical router’s functions is the IP lookup. For each incoming IP packet, IP lookup determines the output port to which the packet should be forwarded. IPv6 addresses are envisioned to replace IPv4 addresses because the IPv4 address space is exhausted. Therefore, modern IP routers need to support IPv6 lookup. Most of the existing IP lookup algorithms are adjusted for the IPv4 lookup, but not for the IPv6 lookup. Scalability represents the main problem in the existing IP lookup algorithms because the IPv6 address space is much larger than the IPv4 address space due to longer IPv6 addresses. In this paper, we propose a novel IPv6 lookup algorithm that supports very large IPv6 lookup tables and achieves high IP lookup throughput.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Cica

2021

ELEKTRON ELEKTROTECH

View full text Add to dashboard Cite

show abstract

“…A trie is a kind of tree structure and has been used in several IP address lookup schemes [9,10]. A binary trie is the most basic trie whose degree is two.…”

Section: Patricia Triementioning

confidence: 99%

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

Kim

Shin

2020

Applied Sciences

View full text Add to dashboard Cite

Named data networking (NDN) is a content-centric network for the future of the internet. An NDN a packet is delivered based on a content name instead of a destination IP address. The name lookup for packet forwarding is challenging because the content name is variable, and its space is unbounded. This paper proposes a novel name lookup scheme that employs a hashing technique combined with Patricia tries. In this scheme, hash tables are dynamically maintained according to the hierarchical structure of the name, so the name can effectively accommodate variable and unbounded content names. Unlike chaining, a Patricia trie compares a key string only once at a leaf node, so it provides a fast name lookup. The proposed lookup scheme is implemented and evaluated by using an Intel Core i7-2600 CPU and 4GB of memory. Experimental results show that our scheme gives good scalability and a high throughput of name lookup with a controlled memory consumption.

show abstract

“…Several trie-based or multibit trie-based schemes have been proposed [3] [13][14][15][16][17][18][19][20]. Srinivasan and Varghese proposed leaf pushing and multibit trie [3].…”

Section: Related Workmentioning

confidence: 99%

“…Lee and Lim proposed multi-stride decision trie which satisfies some characteristics [15]. Wu et al proposed pipelined IP lookup scheme based on a prefix trie [16]. In that scheme, prefixes are classified into short and long groups.…”

Section: Related Workmentioning

confidence: 99%

IMT: A Memory-Efficient and Fast Updatable IP Lookup Architecture Using an Indexed Multibit Trie

2019

KSII TIIS

View full text Add to dashboard Cite

IP address lookup is a function to determine nexthop for a given destination IP address. It takes an important role in modern routers because of its computation time and increasing Internet traffic. TCAM-based IP lookup approaches can exploit the capability of parallel searching but have a limitation of its size due to latency, power consumption, updatability, and cost. On the other hand, multibit trie-based approaches use SRAM which has relatively low power consumption and cost. They reduce the number of memory accesses required for each lookup, but it still needs several accesses. Moreover, the memory efficiency and updatability are proportional to the number of memory accesses. In this paper, we propose a novel architecture using an Indexed Multibit Trie (IMT) which is based on combined TCAM and SRAM. In the proposed architecture, each lookup takes at most two memory accesses. We present how the IMT is constructed so as to be memory-efficient and fast updatable. Experiment results with real-world forwarding tables show that our scheme achieves good memory efficiency as well as fast updatability.

show abstract

Scalable pipelined IP lookup with prefix tries

Cited by 5 publications

References 32 publications

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie

IMT: A Memory-Efficient and Fast Updatable IP Lookup Architecture Using an Indexed Multibit Trie

Contact Info

Product

Resources

About