IP address lookup with the visualizable biased segment tree

Authors:
Inbok Lee;Jeong-Shik Mun;Sung-Ryul Kim
Affiliations:
Department of Computer Science, King's College London, London, United Kingdom;Division of Internet & Media and CAESIT, Konkuk University;Division of Internet & Media and CAESIT, Konkuk University
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Year:
2005

Citing 4
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms in C++

Algorithms in C++
IP lookups using multiway and multicolumn search

IEEE/ACM Transactions on Networking (TON)
A simple and scalable algorithm for the IP address lookup problem

Fundamenta Informaticae - Special issue on computing patterns in strings

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. In this paper we implemented and extended the results of [3] by incorporating the access frequencies of the target IP addresses. Experimental results showed that the number of memory access is reduced significantly.