ScholarLens Back to search
2001•Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lonRequires access

IP Address Lookup using Segment Trees

In-Bok Lee, Geun-Su Park, Yang-Hui Choe, Seong-Gwon Jeong

Open publisher page 0 citations

Abstract

The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

About this research paper

What this paper is about

The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

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 IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

Key concepts: IP forwarding, Prefix, Computer science, Virtual routing and forwarding, Loose Source Routing, Ip address, Bottleneck, Routing table

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
IP Address Lookup using Segment Trees — Research Paper | ScholarLens