2007•Unpublished venueRequires access

Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup

Zhilin Li, Dong Zheng, Yan Ma

Abstract

Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space and poses a great challenge to the routing table lookup algorithms. Today's efficient IPv4 routing table lookup schemes can hardly be competent for IPv6. In this paper, we propose a multi-stage IPv6 routing table lookup algorithm based on a sufficient study on the characteristics of the IPv6 address structure, the IPv6 address allocation policies, and the real world IPv6 backbone BGP routing tables. The proposed algorithm combines the binary tree, the segment table, and the route bucket other than adopting single technique as previous schemes do. Compared with previous algorithms, the proposed algorithm performs faster, occupies less memory, scales better, and supports incremental update.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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: Routing table, Computer science, IPv6, IPv4, Computer network, Table (database), Default-free zone, Routing (electronic design automation)