ScholarLens Back to search
2007•Jisuanji gongchengRequires access

Improved Algorithm for Prefix Length Binary Search

Zhang Baiyi

Open publisher page 1 citations

Abstract

Analyzing on the distribute of IP address prefix in core routers,this paper describes an improved algorithm for the longest matching prefix using binary search on hash tables organized by prefix lengths.It uses prefix expansion to reduce the numbers of the prefix length.Thereby,it decreases the number of hash tables and lowered the height of the search tree.The paper provides a concise and utility Marker store algorithm also,and gives some viewpoints for IPv6 routing lookups.

About this research paper

What this paper is about

Analyzing on the distribute of IP address prefix in core routers,this paper describes an improved algorithm for the longest matching prefix using binary search on hash tables organized by prefix lengths.It uses prefix expansion to reduce the numbers of the prefix length.Thereby,it decreases the number of hash tables and lowered the height of the search tree.The paper provides a concise and utility Marker store algorithm also,and gives some viewpoints for IPv6 routing lookups.

Why it matters

OpenAlex reports 1 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

Analyzing on the distribute of IP address prefix in core routers,this paper describes an improved algorithm for the longest matching prefix using binary search on hash tables organized by prefix lengths.It uses prefix expansion to reduce the numbers of the prefix length.Thereby,it decreases the number of hash tables and lowered the height of the search tree.The paper provides a concise and utility Marker store algorithm also,and gives some viewpoints for IPv6 routing lookups.

Key concepts: Prefix, Computer science, Hash function, Binary search algorithm, Trie, Hash table, IPv6, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Improved Algorithm for Prefix Length Binary Search — Research Paper | ScholarLens