A Trie based IP Lookup Approach for High Performance Router/Switch

Indira, B.; Valarmathi, K.; Devaraj, D.

doi:10.1109/incos45849.2019.8951425

Cited by 7 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…High-performance IP lookups are made possible by the multibit trie, which is used to swiftly search for IP addresses depending on their prefix. This work experimented with various stride value and measure the lookup time with the different data sets [36]. Today's concern is to optimizing the space and reducing the IP look up time.…”

Section: Related Workmentioning

confidence: 99%

CTLA: Compressed Table Look up Algorithm for Open Flow Switch

Sonai,

Bharathi,

Uchimucthu

et al. 2024

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

The size of the TCAM memory grows as more entries are added to the flow table of Open Flow switch. The procedure of looking up an IP address involves finding the longest prefix. In order to keep up with the link speed, the IP lookup operation in the forwarding table should also need to be speed up. TCAM's scalability and storage are constrained by its high power consumption and circuit density. The only time-or space-efficient algorithms for improvement are the subject of several research studies. In order to boost performance even further, this study focuses on time and space efficient algorithms. To strike a balance between speedy data access and efficient storage, this study proposes a combination of compression and a quick look-up mechanism to satisfy the space and speed requirements of the Open Flow switch. As the data is compressed, performance improves because less memory is required to store the look-up table and fewer bits are required to search. The look up complexity of proposed approach is O(log (log n/2)) and average space reduction is 61%.

show abstract

Section: Related Workmentioning

confidence: 99%

CTLA: Compressed Table Look up Algorithm for Open Flow Switch

Sonai,

Bharathi,

Uchimucthu

et al. 2024

IEEE Open J. Comput. Soc.

View full text Add to dashboard Cite

show abstract

“…To reduce the number of memory accesses during lookup, m-ry trees are introduced [3], [6], [8], [17], [21]. M-ry trees use a stride of m bits in each step, so the number of memory accesses in the worst case is m times lower than in the binary tree's worst case.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore, these prefixes need to be pushed to the closest level that is visible in m-ry tree. In [17], Huffman coding is used to compress the lookup table entries into resulting m-ry tree structure. Memory requirements are decreased compared to classic m-ry tree solution, but the main problem of multiple memory accesses remains.…”

Section: Related Workmentioning

confidence: 99%

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

“…Therefore, the existing baseline lookup and naming methods based on trie are less efficient as per the above discussion in achieving unique prefix naming and lookup method for the dynamic scenario in VNDN. Furthermore, the trie can play a crucial role in forwarding tables [7] to get the desired content. This data structure supports both the longest prefix match (LPM) and the exact match (EM).…”

Section: Introductionmentioning

confidence: 99%

Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Ashraf

Huang

Khalid

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Content naming and lookup are decisive functions of the future architecture named data network (NDN). The core concept of NDN is the content distribution between consumers and content providers. The NDN supports advance vehicular networks that is famous with vehicular-named data network (VNDN) with different naming schemes such as hybrid, flat, attribute-based, and hierarchical names. These schemes are used in a static way for vehicular network, in summary, the hybrid, flat, and attribute-based makes a complex structure, and on the other hand, hierarchical names long in length and name lookup performance are a bottleneck in NDN, which can directly affect the network performance. Therefore, we introduce a dynamic naming scheme and lookup method (DNSL) for VNDN to mitigate these issues. We argue that the dynamic naming scheme is a better approach to VNDN, while the static name is a cost-effective, hefty, integrated fashion, and improper for the vehicular network. This study focuses on (1) a dynamic naming scheme using dynamic-tag and (2) a lookup method based on node partition of trie; the trie approach is very famed in data structure and extensively used for the lookup content, insertion, and deletion processes. Our experimental evaluation shows that the DNSL scheme is highly efficient, scalable, and provably correct for VNDN.

show abstract

A Trie based IP Lookup Approach for High Performance Router/Switch

Cited by 7 publications

References 10 publications

CTLA: Compressed Table Look up Algorithm for Open Flow Switch

CTLA: Compressed Table Look up Algorithm for Open Flow Switch

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Dynamic Naming Scheme and Lookup Method Based on Trie for Vehicular Named Data Network

Contact Info

Product

Resources

About