ScholarLens Back to search
2005•Journal of National University of Defense TechnologyRequires access

An IPv6 Routing Lookup Algorithm for Large Route Tables Based on Range Representation B-tree

Sun Zhi-gang

Open publisher page 0 citations

Abstract

The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6,and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address.To solve these two difficult problems,this algorithm converts the prefix into ranges and stores them in a B-tree,then uses range fragment tree in the nodes to reduce the memory access and the storage requirement.Theoretical analysis and the experimental results indicate that the algorithm can support the high performance lookup for huge IPv6 route tables.

About this research paper

What this paper is about

The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6,and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address.To solve these two difficult problems,this algorithm converts the prefix into ranges and stores them in a B-tree,then uses range fragment tree in the nodes to reduce the memory access and the storage requirement.Theoretical analysis and the experimental results indicate that the algorithm can support the high performance lookup for huge IPv6 route tables.

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

The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6,and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address.To solve these two difficult problems,this algorithm converts the prefix into ranges and stores them in a B-tree,then uses range fragment tree in the nodes to reduce the memory access and the storage requirement.Theoretical analysis and the experimental results indicate that the algorithm can support the high performance lookup for huge IPv6 route tables.

Key concepts: Computer science, IPv6, Lookup table, Routing table, Trie, Routing (electronic design automation), Algorithm, Tree (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
An IPv6 Routing Lookup Algorithm for Large Route Tables Based on Range Representation B-tree — Research Paper | ScholarLens