2008•Microelectronics & ComputerRequires access

Analysis and Research of a Fast Algorithm for IPv6 Routing Lookup

Hongyi Liu

Abstract

This paper analyzes the characteristics of IPv6 routing structure in detail,introduces various techniques IPv6 routing lookup,proposes a fast algorithm based on aggregated bit vector for routing lookup and compares the performances of the algorithm with common binary search algorithms.The experimental results indicate that the algorithm improves the speed of search and decreases the memory use.

About this research paper

What this paper is about

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

Key concepts: Computer science, Routing table, Distance-vector routing protocol, Routing (electronic design automation), IPv6, Algorithm, Lookup table, Destination-Sequenced Distance Vector routing