ScholarLens Back to search
2010•Unpublished venueRequires access

IPv6 routing lookup algorithm based on hierarchical Hash

Qiang Chen

Open publisher page 0 citations

Abstract

With the combination of hash table and multibit trie after sufficient and thorough analysis of the now available IPv4 routing algorithm,especially simple and efficient LFT(level forwarding table),the characteristics of IPv6 address and the prefix particularity of real live IPv6 backbone routing table,a hierarchical hash routing lookup algorithm for IPv6 is proposed which using the 32bits prefix as the lookup starting point to achieve faster search just need one memory access.This proposed scheme uses simple data structure,per-forms faster and supports update easily,and improve the IPv6 backbone network forwarding speed to meet the development demand for IPv6.

About this research paper

What this paper is about

With the combination of hash table and multibit trie after sufficient and thorough analysis of the now available IPv4 routing algorithm,especially simple and efficient LFT(level forwarding table),the characteristics of IPv6 address and the prefix particularity of real live IPv6 backbone routing table,a hierarchical hash routing lookup algorithm for IPv6 is proposed which using the 32bits prefix as the lookup starting point to achieve faster search just need one memory access.This proposed scheme uses simple data structure,per-forms faster and supports update easily,and improve the IPv6 backbone network forwarding speed to meet the development demand for IPv6.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

With the combination of hash table and multibit trie after sufficient and thorough analysis of the now available IPv4 routing algorithm,especially simple and efficient LFT(level forwarding table),the characteristics of IPv6 address and the prefix particularity of real live IPv6 backbone routing table,a hierarchical hash routing lookup algorithm for IPv6 is proposed which using the 32bits prefix as the lookup starting point to achieve faster search just need one memory access.This proposed scheme uses simple data structure,per-forms faster and supports update easily,and improve the IPv6 backbone network forwarding speed to meet the development demand for IPv6.

Key concepts: Computer science, Routing table, Trie, IPv6, Hash function, Computer network, Algorithm, Prefix

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
IPv6 routing lookup algorithm based on hierarchical Hash — Research Paper | ScholarLens