2007•Journal of Logistical Engineering UniversityRequires access

A Fast Algorithm Based on Aggregated Bit Vector for IPv6 Routing Lookup

Yong Zhang

Abstract

With wide deployment of IPv6 protocol,traditional IPv4 route lookup algorithms are no longer suitable for packet forwarding of IPv6 routers.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. This paper analyzes the characteristics of IPv6 routing structure in detail,introduces various techniques of 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, IPv6, Bit array, Computer network, Algorithm, Distance-vector routing protocol, Routing (electronic design automation)