Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Simple and Scalable Algorithm for the IP Address Lookup Problem

Lee I., Park K., Choi Y., Chung S.K.

Fundamenta Informaticae

2003

Vol. 56, nr 1,2

181-190

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(logn) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the whole data structure.