A simple and scalable algorithm for the IP address lookup problem

  • Authors:
  • Inbok Lee;Kunsoo Park;Yanghee Choi;Sung Kwon Chung

  • Affiliations:
  • School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Korea;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Korea;School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Korea;Ubiquix Co., Ltd., Seoul 135-010, Korea

  • Venue:
  • Fundamenta Informaticae - Special issue on computing patterns in strings
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

The IP address lookup problem is to find the longest matching IP prefix from a routing table for a given IP address and it 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 does the IP address lookup in O (log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the whole data structure.